./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-sets/test_add-1.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for termination
Using default analysis
Version 6497de01
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1575f453-6428-46a6-afcc-2467402988ca/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1575f453-6428-46a6-afcc-2467402988ca/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1575f453-6428-46a6-afcc-2467402988ca/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1575f453-6428-46a6-afcc-2467402988ca/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-sets/test_add-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1575f453-6428-46a6-afcc-2467402988ca/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1575f453-6428-46a6-afcc-2467402988ca/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ed7fc1ee8e8624c54bbfaff1033820d20aa5fb88ac8eae06fb8e7107f72c3762
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-6497de0
[2024-11-24 00:08:55,921 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-24 00:08:56,011 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1575f453-6428-46a6-afcc-2467402988ca/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Termination-32bit-Automizer_Default.epf
[2024-11-24 00:08:56,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-24 00:08:56,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-24 00:08:56,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-24 00:08:56,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-24 00:08:56,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-24 00:08:56,053 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-24 00:08:56,054 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-24 00:08:56,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-24 00:08:56,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-24 00:08:56,054 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-24 00:08:56,054 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2024-11-24 00:08:56,054 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3
[2024-11-24 00:08:56,054 INFO L153 SettingsManager]: * Use old map elimination=false
[2024-11-24 00:08:56,055 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false
[2024-11-24 00:08:56,056 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true
[2024-11-24 00:08:56,056 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES
[2024-11-24 00:08:56,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-24 00:08:56,057 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME
[2024-11-24 00:08:56,057 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-24 00:08:56,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-24 00:08:56,057 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-24 00:08:56,057 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-24 00:08:56,057 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME
[2024-11-24 00:08:56,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME
[2024-11-24 00:08:56,057 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME
[2024-11-24 00:08:56,058 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-24 00:08:56,058 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-24 00:08:56,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-24 00:08:56,058 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false
[2024-11-24 00:08:56,058 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-11-24 00:08:56,058 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-24 00:08:56,058 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-24 00:08:56,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 00:08:56,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-24 00:08:56,059 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL_NO_AM
[2024-11-24 00:08:56,059 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2024-11-24 00:08:56,059 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1575f453-6428-46a6-afcc-2467402988ca/bin/uautomizer-verify-LYvppIcaGC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ed7fc1ee8e8624c54bbfaff1033820d20aa5fb88ac8eae06fb8e7107f72c3762
[2024-11-24 00:08:56,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-24 00:08:56,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-24 00:08:56,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-24 00:08:56,383 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-24 00:08:56,384 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-24 00:08:56,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1575f453-6428-46a6-afcc-2467402988ca/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/ldv-sets/test_add-1.i
[2024-11-24 00:08:59,373 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1575f453-6428-46a6-afcc-2467402988ca/bin/uautomizer-verify-LYvppIcaGC/data/fb606d971/55fa8a8412024125bafac74c40a8a2be/FLAG52909a3d7
[2024-11-24 00:08:59,697 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-24 00:08:59,697 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1575f453-6428-46a6-afcc-2467402988ca/sv-benchmarks/c/ldv-sets/test_add-1.i
[2024-11-24 00:08:59,711 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1575f453-6428-46a6-afcc-2467402988ca/bin/uautomizer-verify-LYvppIcaGC/data/fb606d971/55fa8a8412024125bafac74c40a8a2be/FLAG52909a3d7
[2024-11-24 00:08:59,729 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1575f453-6428-46a6-afcc-2467402988ca/bin/uautomizer-verify-LYvppIcaGC/data/fb606d971/55fa8a8412024125bafac74c40a8a2be
[2024-11-24 00:08:59,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-24 00:08:59,734 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-24 00:08:59,735 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-24 00:08:59,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-24 00:08:59,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-24 00:08:59,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:08:59" (1/1) ...
[2024-11-24 00:08:59,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b0a2f9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:08:59, skipping insertion in model container
[2024-11-24 00:08:59,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:08:59" (1/1) ...
[2024-11-24 00:08:59,772 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-24 00:09:00,092 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 00:09:00,104 INFO L200 MainTranslator]: Completed pre-run
[2024-11-24 00:09:00,167 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 00:09:00,203 INFO L204 MainTranslator]: Completed translation
[2024-11-24 00:09:00,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:09:00 WrapperNode
[2024-11-24 00:09:00,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-24 00:09:00,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-24 00:09:00,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-24 00:09:00,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-24 00:09:00,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:09:00" (1/1) ...
[2024-11-24 00:09:00,227 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:09:00" (1/1) ...
[2024-11-24 00:09:00,252 INFO L138 Inliner]: procedures = 135, calls = 47, calls flagged for inlining = 16, calls inlined = 11, statements flattened = 118
[2024-11-24 00:09:00,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-24 00:09:00,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-24 00:09:00,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-24 00:09:00,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-24 00:09:00,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:09:00" (1/1) ...
[2024-11-24 00:09:00,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:09:00" (1/1) ...
[2024-11-24 00:09:00,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:09:00" (1/1) ...
[2024-11-24 00:09:00,315 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 5 writes are split as follows [0, 5].
[2024-11-24 00:09:00,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:09:00" (1/1) ...
[2024-11-24 00:09:00,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:09:00" (1/1) ...
[2024-11-24 00:09:00,332 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:09:00" (1/1) ...
[2024-11-24 00:09:00,336 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:09:00" (1/1) ...
[2024-11-24 00:09:00,341 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:09:00" (1/1) ...
[2024-11-24 00:09:00,342 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:09:00" (1/1) ...
[2024-11-24 00:09:00,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:09:00" (1/1) ...
[2024-11-24 00:09:00,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-24 00:09:00,355 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-24 00:09:00,355 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-24 00:09:00,355 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-24 00:09:00,356 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:09:00" (1/1) ...
[2024-11-24 00:09:00,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-24 00:09:00,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1575f453-6428-46a6-afcc-2467402988ca/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:09:00,403 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1575f453-6428-46a6-afcc-2467402988ca/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-24 00:09:00,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1575f453-6428-46a6-afcc-2467402988ca/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2024-11-24 00:09:00,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0
[2024-11-24 00:09:00,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1
[2024-11-24 00:09:00,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0
[2024-11-24 00:09:00,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1
[2024-11-24 00:09:00,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-11-24 00:09:00,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-24 00:09:00,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0
[2024-11-24 00:09:00,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1
[2024-11-24 00:09:00,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0
[2024-11-24 00:09:00,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1
[2024-11-24 00:09:00,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0
[2024-11-24 00:09:00,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1
[2024-11-24 00:09:00,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-24 00:09:00,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1
[2024-11-24 00:09:00,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-24 00:09:00,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-24 00:09:00,613 INFO L234 CfgBuilder]: Building ICFG
[2024-11-24 00:09:00,615 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-24 00:09:00,963 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live.
[2024-11-24 00:09:00,965 INFO L283 CfgBuilder]: Performing block encoding
[2024-11-24 00:09:00,976 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-24 00:09:00,976 INFO L312 CfgBuilder]: Removed 2 assume(true) statements.
[2024-11-24 00:09:00,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:09:00 BoogieIcfgContainer
[2024-11-24 00:09:00,977 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-24 00:09:00,979 INFO L112 PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2024-11-24 00:09:00,979 INFO L270 PluginConnector]: Initializing BuchiAutomizer...
[2024-11-24 00:09:00,989 INFO L274 PluginConnector]: BuchiAutomizer initialized
[2024-11-24 00:09:00,990 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-24 00:09:00,990 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 24.11 12:08:59" (1/3) ...
[2024-11-24 00:09:00,991 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@129fbd4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 24.11 12:09:00, skipping insertion in model container
[2024-11-24 00:09:00,991 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-24 00:09:00,991 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:09:00" (2/3) ...
[2024-11-24 00:09:00,991 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@129fbd4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 24.11 12:09:00, skipping insertion in model container
[2024-11-24 00:09:00,991 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-24 00:09:00,991 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:09:00" (3/3) ...
[2024-11-24 00:09:00,993 INFO L363 chiAutomizerObserver]: Analyzing ICFG test_add-1.i
[2024-11-24 00:09:01,043 INFO L300 stractBuchiCegarLoop]: Interprodecural is true
[2024-11-24 00:09:01,043 INFO L301 stractBuchiCegarLoop]: Hoare is None
[2024-11-24 00:09:01,043 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2024-11-24 00:09:01,043 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2024-11-24 00:09:01,043 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2024-11-24 00:09:01,044 INFO L305 stractBuchiCegarLoop]: Difference is false
[2024-11-24 00:09:01,044 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2024-11-24 00:09:01,044 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2024-11-24 00:09:01,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:09:01,067 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6
[2024-11-24 00:09:01,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-24 00:09:01,067 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-24 00:09:01,073 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-24 00:09:01,073 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2024-11-24 00:09:01,073 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============
[2024-11-24 00:09:01,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:09:01,079 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6
[2024-11-24 00:09:01,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-24 00:09:01,079 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-24 00:09:01,080 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-24 00:09:01,080 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2024-11-24 00:09:01,087 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(8, 3);~#s1~0.base, ~#s1~0.offset := 3, 0;call write~init~$Pointer$#1(~#s1~0.base, ~#s1~0.offset, ~#s1~0.base, ~#s1~0.offset, 4);call write~init~$Pointer$#1(~#s1~0.base, ~#s1~0.offset, ~#s1~0.base, 4 + ~#s1~0.offset, 4);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_foo } true;havoc foo_#t~nondet32#1, foo_#t~ret33#1, foo_~j~0#1;havoc foo_#t~nondet32#1;foo_~j~0#1 := foo_#t~nondet32#1;havoc foo_#t~nondet32#1;assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~new#1, ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset := foo_~j~0#1, ~#s1~0.base, ~#s1~0.offset;havoc ldv_set_add_#t~ret17#1, ldv_set_add_#t~ret18#1.base, ldv_set_add_#t~ret18#1.offset, ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset, ldv_set_add_~new#1, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;ldv_set_add_~new#1 := ldv_set_add_#in~new#1;ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset := ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := ldv_set_add_~new#1, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem28#1, ldv_is_in_set_#t~mem29#1.base, ldv_is_in_set_#t~mem29#1.offset, ldv_is_in_set_#t~ret30#1.base, ldv_is_in_set_#t~ret30#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1 := ldv_is_in_set_#in~e#1;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset := read~$Pointer$#1(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset;havoc ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset;ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4;havoc ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset;havoc ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset;"
[2024-11-24 00:09:01,087 INFO L749 eck$LassoCheckResult]: Loop: "assume ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset;" "call ldv_is_in_set_#t~mem28#1 := read~int#1(ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset, 4);" "assume !(ldv_is_in_set_#t~mem28#1 == ldv_is_in_set_~e#1);havoc ldv_is_in_set_#t~mem28#1;call ldv_is_in_set_#t~mem29#1.base, ldv_is_in_set_#t~mem29#1.offset := read~$Pointer$#1(ldv_is_in_set_~m~1#1.base, 4 + ldv_is_in_set_~m~1#1.offset, 4);ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset := ldv_is_in_set_#t~mem29#1.base, ldv_is_in_set_#t~mem29#1.offset;havoc ldv_is_in_set_#t~mem29#1.base, ldv_is_in_set_#t~mem29#1.offset;ldv_is_in_set_#t~ret30#1.base, ldv_is_in_set_#t~ret30#1.offset := ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset - 4;havoc ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_#t~ret30#1.base, ldv_is_in_set_#t~ret30#1.offset;havoc ldv_is_in_set_#t~ret30#1.base, ldv_is_in_set_#t~ret30#1.offset;"
[2024-11-24 00:09:01,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:09:01,091 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times
[2024-11-24 00:09:01,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM
[2024-11-24 00:09:01,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546501630]
[2024-11-24 00:09:01,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:09:01,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:09:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 00:09:01,207 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-24 00:09:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 00:09:01,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace
[2024-11-24 00:09:01,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:09:01,259 INFO L85 PathProgramCache]: Analyzing trace with hash 37868, now seen corresponding path program 1 times
[2024-11-24 00:09:01,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM
[2024-11-24 00:09:01,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910529486]
[2024-11-24 00:09:01,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:09:01,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:09:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 00:09:01,291 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-24 00:09:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 00:09:01,303 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace
[2024-11-24 00:09:01,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:09:01,307 INFO L85 PathProgramCache]: Analyzing trace with hash 28696810, now seen corresponding path program 1 times
[2024-11-24 00:09:01,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM
[2024-11-24 00:09:01,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916383377]
[2024-11-24 00:09:01,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:09:01,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:09:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:09:01,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace
[2024-11-24 00:09:01,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916383377]
[2024-11-24 00:09:01,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916383377] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-24 00:09:01,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68077197]
[2024-11-24 00:09:01,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:09:01,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:09:01,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1575f453-6428-46a6-afcc-2467402988ca/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:09:01,684 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1575f453-6428-46a6-afcc-2467402988ca/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 00:09:01,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1575f453-6428-46a6-afcc-2467402988ca/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-24 00:09:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:09:01,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 25 conjuncts are in the unsatisfiable core
[2024-11-24 00:09:01,812 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 00:09:01,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-11-24 00:09:01,982 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-24 00:09:02,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68077197] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-24 00:09:02,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-24 00:09:02,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6
[2024-11-24 00:09:02,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555040147]
[2024-11-24 00:09:02,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-24 00:09:02,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM
[2024-11-24 00:09:02,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-24 00:09:02,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-11-24 00:09:02,278 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:09:02,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-24 00:09:02,504 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions.
[2024-11-24 00:09:02,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 36 transitions.
[2024-11-24 00:09:02,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3
[2024-11-24 00:09:02,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 15 states and 15 transitions.
[2024-11-24 00:09:02,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15
[2024-11-24 00:09:02,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15
[2024-11-24 00:09:02,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 15 transitions.
[2024-11-24 00:09:02,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-24 00:09:02,520 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 15 transitions.
[2024-11-24 00:09:02,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 15 transitions.
[2024-11-24 00:09:02,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15.
[2024-11-24 00:09:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.0) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 00:09:02,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions.
[2024-11-24 00:09:02,542 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 15 transitions.
[2024-11-24 00:09:02,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-24 00:09:02,548 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 15 transitions.
[2024-11-24 00:09:02,550 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============
[2024-11-24 00:09:02,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 15 transitions.
[2024-11-24 00:09:02,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3
[2024-11-24 00:09:02,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-24 00:09:02,551 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-24 00:09:02,551 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 00:09:02,551 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2024-11-24 00:09:02,552 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(8, 3);~#s1~0.base, ~#s1~0.offset := 3, 0;call write~init~$Pointer$#1(~#s1~0.base, ~#s1~0.offset, ~#s1~0.base, ~#s1~0.offset, 4);call write~init~$Pointer$#1(~#s1~0.base, ~#s1~0.offset, ~#s1~0.base, 4 + ~#s1~0.offset, 4);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_foo } true;havoc foo_#t~nondet32#1, foo_#t~ret33#1, foo_~j~0#1;havoc foo_#t~nondet32#1;foo_~j~0#1 := foo_#t~nondet32#1;havoc foo_#t~nondet32#1;assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~new#1, ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset := foo_~j~0#1, ~#s1~0.base, ~#s1~0.offset;havoc ldv_set_add_#t~ret17#1, ldv_set_add_#t~ret18#1.base, ldv_set_add_#t~ret18#1.offset, ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset, ldv_set_add_~new#1, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;ldv_set_add_~new#1 := ldv_set_add_#in~new#1;ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset := ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := ldv_set_add_~new#1, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem28#1, ldv_is_in_set_#t~mem29#1.base, ldv_is_in_set_#t~mem29#1.offset, ldv_is_in_set_#t~ret30#1.base, ldv_is_in_set_#t~ret30#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1 := ldv_is_in_set_#in~e#1;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset := read~$Pointer$#1(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset;havoc ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset;ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4;havoc ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset;havoc ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset;" "assume !(ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset);" "ldv_is_in_set_#res#1 := 0;" "ldv_set_add_#t~ret17#1 := ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem28#1, ldv_is_in_set_#t~mem29#1.base, ldv_is_in_set_#t~mem29#1.offset, ldv_is_in_set_#t~ret30#1.base, ldv_is_in_set_#t~ret30#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;havoc ldv_is_in_set_#in~e#1, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;assume { :end_inline_ldv_is_in_set } true;" "assume 0 == ldv_set_add_#t~ret17#1;havoc ldv_set_add_#t~ret17#1;havoc ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset;assume { :begin_inline_ldv_successful_malloc } true;ldv_successful_malloc_#in~size#1 := 12;havoc ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;havoc ldv_successful_malloc_#t~malloc5#1.base, ldv_successful_malloc_#t~malloc5#1.offset, ldv_successful_malloc_~size#1, ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset;ldv_successful_malloc_~size#1 := ldv_successful_malloc_#in~size#1;call ldv_successful_malloc_#t~malloc5#1.base, ldv_successful_malloc_#t~malloc5#1.offset := #Ultimate.allocOnHeap(ldv_successful_malloc_~size#1 % 4294967296);ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset := ldv_successful_malloc_#t~malloc5#1.base, ldv_successful_malloc_#t~malloc5#1.offset;havoc ldv_successful_malloc_#t~malloc5#1.base, ldv_successful_malloc_#t~malloc5#1.offset;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ldv_successful_malloc_~ptr~0#1.base != 0 || ldv_successful_malloc_~ptr~0#1.offset != 0 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1;" "assume !(0 == assume_abort_if_not_~cond#1);" "havoc assume_abort_if_not_~cond#1;havoc assume_abort_if_not_#in~cond#1;assume { :end_inline_assume_abort_if_not } true;ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset := ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset;" "ldv_set_add_#t~ret18#1.base, ldv_set_add_#t~ret18#1.offset := ldv_successful_malloc_#res#1.base, ldv_successful_malloc_#res#1.offset;havoc ldv_successful_malloc_#t~malloc5#1.base, ldv_successful_malloc_#t~malloc5#1.offset, ldv_successful_malloc_~size#1, ldv_successful_malloc_~ptr~0#1.base, ldv_successful_malloc_~ptr~0#1.offset;havoc ldv_successful_malloc_#in~size#1;assume { :end_inline_ldv_successful_malloc } true;ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset := ldv_set_add_#t~ret18#1.base, ldv_set_add_#t~ret18#1.offset;havoc ldv_set_add_#t~ret18#1.base, ldv_set_add_#t~ret18#1.offset;call write~int#1(ldv_set_add_~new#1, ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset, 4);assume { :begin_inline_ldv_list_add } true;ldv_list_add_#in~new#1.base, ldv_list_add_#in~new#1.offset, ldv_list_add_#in~head#1.base, ldv_list_add_#in~head#1.offset := ldv_set_add_~le~0#1.base, 4 + ldv_set_add_~le~0#1.offset, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;havoc ldv_list_add_#t~mem6#1.base, ldv_list_add_#t~mem6#1.offset, ldv_list_add_~new#1.base, ldv_list_add_~new#1.offset, ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset;ldv_list_add_~new#1.base, ldv_list_add_~new#1.offset := ldv_list_add_#in~new#1.base, ldv_list_add_#in~new#1.offset;ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset := ldv_list_add_#in~head#1.base, ldv_list_add_#in~head#1.offset;call ldv_list_add_#t~mem6#1.base, ldv_list_add_#t~mem6#1.offset := read~$Pointer$#1(ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset, 4);assume { :begin_inline___ldv_list_add } true;__ldv_list_add_#in~new#1.base, __ldv_list_add_#in~new#1.offset, __ldv_list_add_#in~prev#1.base, __ldv_list_add_#in~prev#1.offset, __ldv_list_add_#in~next#1.base, __ldv_list_add_#in~next#1.offset := ldv_list_add_~new#1.base, ldv_list_add_~new#1.offset, ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset, ldv_list_add_#t~mem6#1.base, ldv_list_add_#t~mem6#1.offset;havoc __ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, __ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset, __ldv_list_add_~next#1.base, __ldv_list_add_~next#1.offset;__ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset := __ldv_list_add_#in~new#1.base, __ldv_list_add_#in~new#1.offset;__ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset := __ldv_list_add_#in~prev#1.base, __ldv_list_add_#in~prev#1.offset;__ldv_list_add_~next#1.base, __ldv_list_add_~next#1.offset := __ldv_list_add_#in~next#1.base, __ldv_list_add_#in~next#1.offset;call write~$Pointer$#1(__ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, __ldv_list_add_~next#1.base, 4 + __ldv_list_add_~next#1.offset, 4);call write~$Pointer$#1(__ldv_list_add_~next#1.base, __ldv_list_add_~next#1.offset, __ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, 4);call write~$Pointer$#1(__ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset, __ldv_list_add_~new#1.base, 4 + __ldv_list_add_~new#1.offset, 4);call write~$Pointer$#1(__ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, __ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset, 4);" "havoc __ldv_list_add_~new#1.base, __ldv_list_add_~new#1.offset, __ldv_list_add_~prev#1.base, __ldv_list_add_~prev#1.offset, __ldv_list_add_~next#1.base, __ldv_list_add_~next#1.offset;havoc __ldv_list_add_#in~new#1.base, __ldv_list_add_#in~new#1.offset, __ldv_list_add_#in~prev#1.base, __ldv_list_add_#in~prev#1.offset, __ldv_list_add_#in~next#1.base, __ldv_list_add_#in~next#1.offset;assume { :end_inline___ldv_list_add } true;havoc ldv_list_add_#t~mem6#1.base, ldv_list_add_#t~mem6#1.offset;" "havoc ldv_list_add_#t~mem6#1.base, ldv_list_add_#t~mem6#1.offset, ldv_list_add_~new#1.base, ldv_list_add_~new#1.offset, ldv_list_add_~head#1.base, ldv_list_add_~head#1.offset;havoc ldv_list_add_#in~new#1.base, ldv_list_add_#in~new#1.offset, ldv_list_add_#in~head#1.base, ldv_list_add_#in~head#1.offset;assume { :end_inline_ldv_list_add } true;havoc ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset;" "havoc ldv_set_add_#t~ret17#1, ldv_set_add_#t~ret18#1.base, ldv_set_add_#t~ret18#1.offset, ldv_set_add_~le~0#1.base, ldv_set_add_~le~0#1.offset, ldv_set_add_~new#1, ldv_set_add_~s#1.base, ldv_set_add_~s#1.offset;havoc ldv_set_add_#in~new#1, ldv_set_add_#in~s#1.base, ldv_set_add_#in~s#1.offset;assume { :end_inline_ldv_set_add } true;assume { :begin_inline_ldv_is_in_set } true;ldv_is_in_set_#in~e#1, ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset := foo_~j~0#1, ~#s1~0.base, ~#s1~0.offset;havoc ldv_is_in_set_#res#1;havoc ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset, ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset, ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset, ldv_is_in_set_#t~mem28#1, ldv_is_in_set_#t~mem29#1.base, ldv_is_in_set_#t~mem29#1.offset, ldv_is_in_set_#t~ret30#1.base, ldv_is_in_set_#t~ret30#1.offset, ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset, ldv_is_in_set_~e#1, ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;ldv_is_in_set_~e#1 := ldv_is_in_set_#in~e#1;ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset := ldv_is_in_set_#in~s#1.base, ldv_is_in_set_#in~s#1.offset;havoc ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset;call ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset := read~$Pointer$#1(ldv_is_in_set_~s#1.base, ldv_is_in_set_~s#1.offset, 4);ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset := ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset;havoc ldv_is_in_set_#t~mem26#1.base, ldv_is_in_set_#t~mem26#1.offset;ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset := ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset - 4;havoc ldv_is_in_set_~__mptr~3#1.base, ldv_is_in_set_~__mptr~3#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset;havoc ldv_is_in_set_#t~ret27#1.base, ldv_is_in_set_#t~ret27#1.offset;"
[2024-11-24 00:09:02,553 INFO L749 eck$LassoCheckResult]: Loop: "assume ldv_is_in_set_~m~1#1.base != ldv_is_in_set_~s#1.base || 4 + ldv_is_in_set_~m~1#1.offset != ldv_is_in_set_~s#1.offset;" "call ldv_is_in_set_#t~mem28#1 := read~int#1(ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset, 4);" "assume !(ldv_is_in_set_#t~mem28#1 == ldv_is_in_set_~e#1);havoc ldv_is_in_set_#t~mem28#1;call ldv_is_in_set_#t~mem29#1.base, ldv_is_in_set_#t~mem29#1.offset := read~$Pointer$#1(ldv_is_in_set_~m~1#1.base, 4 + ldv_is_in_set_~m~1#1.offset, 4);ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset := ldv_is_in_set_#t~mem29#1.base, ldv_is_in_set_#t~mem29#1.offset;havoc ldv_is_in_set_#t~mem29#1.base, ldv_is_in_set_#t~mem29#1.offset;ldv_is_in_set_#t~ret30#1.base, ldv_is_in_set_#t~ret30#1.offset := ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset - 4;havoc ldv_is_in_set_~__mptr~4#1.base, ldv_is_in_set_~__mptr~4#1.offset;ldv_is_in_set_~m~1#1.base, ldv_is_in_set_~m~1#1.offset := ldv_is_in_set_#t~ret30#1.base, ldv_is_in_set_#t~ret30#1.offset;havoc ldv_is_in_set_#t~ret30#1.base, ldv_is_in_set_#t~ret30#1.offset;"
[2024-11-24 00:09:02,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:09:02,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1205028199, now seen corresponding path program 1 times
[2024-11-24 00:09:02,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM
[2024-11-24 00:09:02,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353753866]
[2024-11-24 00:09:02,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:09:02,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:09:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 00:09:02,757 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-24 00:09:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 00:09:02,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace
[2024-11-24 00:09:02,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:09:02,821 INFO L85 PathProgramCache]: Analyzing trace with hash 78581, now seen corresponding path program 1 times
[2024-11-24 00:09:02,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM
[2024-11-24 00:09:02,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964747094]
[2024-11-24 00:09:02,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:09:02,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:09:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 00:09:02,831 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-24 00:09:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 00:09:02,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace
[2024-11-24 00:09:02,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 00:09:02,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1658367651, now seen corresponding path program 1 times
[2024-11-24 00:09:02,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM
[2024-11-24 00:09:02,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725584639]
[2024-11-24 00:09:02,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:09:02,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 00:09:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:09:04,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace
[2024-11-24 00:09:04,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725584639]
[2024-11-24 00:09:04,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725584639] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-24 00:09:04,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22667994]
[2024-11-24 00:09:04,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 00:09:04,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-24 00:09:04,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1575f453-6428-46a6-afcc-2467402988ca/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 00:09:04,660 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1575f453-6428-46a6-afcc-2467402988ca/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-24 00:09:04,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1575f453-6428-46a6-afcc-2467402988ca/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-24 00:09:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 00:09:04,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 101 conjuncts are in the unsatisfiable core
[2024-11-24 00:09:04,851 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-24 00:09:05,044 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-11-24 00:09:05,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2024-11-24 00:09:05,408 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-24 00:09:05,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19
[2024-11-24 00:09:05,441 INFO L349 Elim1Store]: treesize reduction 27, result has 32.5 percent of original size
[2024-11-24 00:09:05,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 17
[2024-11-24 00:09:05,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 100
[2024-11-24 00:09:05,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17
[2024-11-24 00:09:05,512 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-24 00:09:05,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12
[2024-11-24 00:09:05,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1
[2024-11-24 00:09:05,559 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-24 00:09:05,596 WARN L214 Elim1Store]: Array PQE input equivalent to false
[2024-11-24 00:09:05,789 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size
[2024-11-24 00:09:05,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 58
[2024-11-24 00:09:05,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 44
[2024-11-24 00:09:05,881 INFO L190 IndexEqualityManager]: detected not equals via solver
[2024-11-24 00:09:05,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27
[2024-11-24 00:09:05,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-11-24 00:09:05,894 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-24 00:09:06,198 INFO L349 Elim1Store]: treesize reduction 307, result has 51.0 percent of original size
[2024-11-24 00:09:06,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 4290 treesize of output 4300
[2024-11-24 00:09:06,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-24 00:09:06,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32690 treesize of output 32338
[2024-11-24 00:09:06,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13682 treesize of output 13394
[2024-11-24 00:09:07,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-24 00:09:07,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17402 treesize of output 13112
[2024-11-24 00:09:08,708 INFO L349 Elim1Store]: treesize reduction 66, result has 70.1 percent of original size
[2024-11-24 00:09:08,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 16569 treesize of output 15939
[2024-11-24 00:09:09,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14820 treesize of output 14554
[2024-11-24 00:09:10,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-24 00:09:10,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 12729 treesize of output 12101
[2024-11-24 00:09:18,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-11-24 00:09:19,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3
[2024-11-24 00:09:19,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-11-24 00:09:19,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3
[2024-11-24 00:09:19,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-11-24 00:09:19,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-11-24 00:09:19,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3
[2024-11-24 00:09:19,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-11-24 00:09:19,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-11-24 00:09:19,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3
[2024-11-24 00:09:19,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3
[2024-11-24 00:09:19,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-11-24 00:09:50,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-11-24 00:09:50,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 10157 treesize of output 10089
[2024-11-24 00:16:38,751 WARN L286 SmtUtils]: Spent 13.50s on a formula simplification. DAG size of input: 4342 DAG size of output: 4428 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-24 00:16:50,711 WARN L286 SmtUtils]: Spent 5.18s on a formula simplification. DAG size of input: 4532 DAG size of output: 4528 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-24 00:19:02,387 WARN L286 SmtUtils]: Spent 5.46s on a formula simplification. DAG size of input: 4585 DAG size of output: 4575 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2024-11-24 00:22:34,302 WARN L286 SmtUtils]: Spent 11.85s on a formula simplification. DAG size of input: 4632 DAG size of output: 4632 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)