./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:22:20,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:22:20,877 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-30 10:22:20,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:22:20,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:22:20,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:22:20,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:22:20,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:22:20,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:22:20,911 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:22:20,912 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:22:20,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:22:20,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:22:20,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:22:20,913 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:22:20,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:22:20,913 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:22:20,913 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:22:20,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:22:20,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:22:20,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:22:20,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:22:20,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:22:20,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:22:20,914 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-30 10:22:20,914 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:22:20,914 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:22:20,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:22:20,914 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:22:20,914 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:22:20,914 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:22:20,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:22:20,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:22:20,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:22:20,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:22:20,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:22:20,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:22:20,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:22:20,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:22:20,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:22:20,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:22:20,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:22:20,915 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:22:20,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:22:20,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:22:20,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:22:20,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:22:20,915 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:22:20,915 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:22:20,915 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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(G ! overflow) ) 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 -> 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f [2025-04-30 10:22:21,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:22:21,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:22:21,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:22:21,171 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:22:21,171 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:22:21,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01-2.i [2025-04-30 10:22:22,490 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e09e94279/15d56fb005d64e63888560b5bef94ec2/FLAG448d65a33 [2025-04-30 10:22:22,699 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:22:22,699 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01-2.i [2025-04-30 10:22:22,709 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e09e94279/15d56fb005d64e63888560b5bef94ec2/FLAG448d65a33 [2025-04-30 10:22:23,489 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e09e94279/15d56fb005d64e63888560b5bef94ec2 [2025-04-30 10:22:23,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:22:23,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:22:23,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:22:23,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:22:23,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:22:23,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:22:23" (1/1) ... [2025-04-30 10:22:23,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@319c5634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:23, skipping insertion in model container [2025-04-30 10:22:23,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:22:23" (1/1) ... [2025-04-30 10:22:23,523 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:22:23,790 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:22:23,799 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:22:23,862 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:22:23,880 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:22:23,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:23 WrapperNode [2025-04-30 10:22:23,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:22:23,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:22:23,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:22:23,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:22:23,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:23" (1/1) ... [2025-04-30 10:22:23,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:23" (1/1) ... [2025-04-30 10:22:23,908 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 93 [2025-04-30 10:22:23,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:22:23,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:22:23,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:22:23,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:22:23,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:23" (1/1) ... [2025-04-30 10:22:23,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:23" (1/1) ... [2025-04-30 10:22:23,918 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:23" (1/1) ... [2025-04-30 10:22:23,944 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [2, 31, 11]. 70 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 16, 2]. [2025-04-30 10:22:23,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:23" (1/1) ... [2025-04-30 10:22:23,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:23" (1/1) ... [2025-04-30 10:22:23,956 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:23" (1/1) ... [2025-04-30 10:22:23,957 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:23" (1/1) ... [2025-04-30 10:22:23,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:23" (1/1) ... [2025-04-30 10:22:23,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:23" (1/1) ... [2025-04-30 10:22:23,965 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:23" (1/1) ... [2025-04-30 10:22:23,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:22:23,973 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:22:23,973 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:22:23,973 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:22:23,974 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:23" (1/1) ... [2025-04-30 10:22:23,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:22:23,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:23,994 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:22:23,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:22:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:22:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:22:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-30 10:22:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:22:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:22:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:22:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:22:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2025-04-30 10:22:24,013 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2025-04-30 10:22:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:22:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:22:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:22:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:22:24,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:22:24,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:22:24,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:22:24,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:22:24,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:22:24,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:22:24,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:22:24,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:22:24,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:22:24,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:22:24,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:22:24,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:22:24,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:22:24,111 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:22:24,113 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:22:24,346 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-04-30 10:22:24,347 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:22:24,355 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:22:24,355 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-30 10:22:24,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:22:24 BoogieIcfgContainer [2025-04-30 10:22:24,356 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:22:24,357 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:22:24,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:22:24,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:22:24,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:22:23" (1/3) ... [2025-04-30 10:22:24,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bba6539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:22:24, skipping insertion in model container [2025-04-30 10:22:24,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:23" (2/3) ... [2025-04-30 10:22:24,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bba6539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:22:24, skipping insertion in model container [2025-04-30 10:22:24,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:22:24" (3/3) ... [2025-04-30 10:22:24,364 INFO L128 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-2.i [2025-04-30 10:22:24,373 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:22:24,375 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG complex_data_creation_test01-2.i that has 2 procedures, 49 locations, 66 edges, 1 initial locations, 4 loop locations, and 6 error locations. [2025-04-30 10:22:24,411 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:22:24,420 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7b6e79c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:22:24,420 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-30 10:22:24,422 INFO L278 IsEmpty]: Start isEmpty. Operand has 49 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 45 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:22:24,426 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:22:24,426 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:24,426 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:24,427 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-30 10:22:24,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:24,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1517825584, now seen corresponding path program 1 times [2025-04-30 10:22:24,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:24,436 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558922902] [2025-04-30 10:22:24,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:24,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:24,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:22:24,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:22:24,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:24,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:24,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:24,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:24,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558922902] [2025-04-30 10:22:24,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558922902] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:24,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:22:24,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:22:24,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850287860] [2025-04-30 10:22:24,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:24,714 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:22:24,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:24,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:22:24,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:22:24,728 INFO L87 Difference]: Start difference. First operand has 49 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 45 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:24,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:24,770 INFO L93 Difference]: Finished difference Result 99 states and 134 transitions. [2025-04-30 10:22:24,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:22:24,772 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-04-30 10:22:24,773 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:24,776 INFO L225 Difference]: With dead ends: 99 [2025-04-30 10:22:24,776 INFO L226 Difference]: Without dead ends: 44 [2025-04-30 10:22:24,778 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:22:24,782 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 1 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:24,783 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 170 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:22:24,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-04-30 10:22:24,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-04-30 10:22:24,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.457142857142857) internal successors, (51), 40 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:22:24,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2025-04-30 10:22:24,810 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 10 [2025-04-30 10:22:24,810 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:24,811 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2025-04-30 10:22:24,811 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:24,811 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2025-04-30 10:22:24,812 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:22:24,813 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:24,813 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:24,813 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:22:24,814 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-30 10:22:24,814 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:24,814 INFO L85 PathProgramCache]: Analyzing trace with hash 126328194, now seen corresponding path program 1 times [2025-04-30 10:22:24,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:24,815 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505455978] [2025-04-30 10:22:24,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:24,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:24,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:22:24,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:22:24,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:24,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:22:24,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:24,990 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505455978] [2025-04-30 10:22:24,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505455978] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:24,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:22:24,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:22:24,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385795446] [2025-04-30 10:22:24,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:24,991 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:22:24,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:24,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:22:24,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:22:24,991 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:25,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:25,033 INFO L93 Difference]: Finished difference Result 117 states and 148 transitions. [2025-04-30 10:22:25,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:22:25,034 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-30 10:22:25,034 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:25,035 INFO L225 Difference]: With dead ends: 117 [2025-04-30 10:22:25,035 INFO L226 Difference]: Without dead ends: 75 [2025-04-30 10:22:25,036 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:22:25,037 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 32 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:25,037 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 144 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:22:25,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-30 10:22:25,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2025-04-30 10:22:25,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 64 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:22:25,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2025-04-30 10:22:25,048 INFO L79 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 13 [2025-04-30 10:22:25,048 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:25,048 INFO L485 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2025-04-30 10:22:25,048 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:25,048 INFO L278 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2025-04-30 10:22:25,048 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:22:25,048 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:25,048 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:25,048 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:22:25,048 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-30 10:22:25,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:25,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1901335556, now seen corresponding path program 1 times [2025-04-30 10:22:25,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:25,049 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006378127] [2025-04-30 10:22:25,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:25,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:25,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:22:25,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:22:25,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:25,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:25,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:25,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:25,192 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006378127] [2025-04-30 10:22:25,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006378127] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:25,192 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894335896] [2025-04-30 10:22:25,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:25,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:25,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:25,198 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:22:25,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:22:25,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:22:25,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:22:25,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:25,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:25,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:22:25,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:25,323 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:22:25,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894335896] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:25,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:22:25,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-30 10:22:25,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145848402] [2025-04-30 10:22:25,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:25,323 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:22:25,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:25,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:22:25,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:22:25,324 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:25,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:25,349 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2025-04-30 10:22:25,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:22:25,349 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-30 10:22:25,349 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:25,350 INFO L225 Difference]: With dead ends: 69 [2025-04-30 10:22:25,350 INFO L226 Difference]: Without dead ends: 68 [2025-04-30 10:22:25,350 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:22:25,350 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:25,351 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 182 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:22:25,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-04-30 10:22:25,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-04-30 10:22:25,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 59 states have (on average 1.423728813559322) internal successors, (84), 63 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:22:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 88 transitions. [2025-04-30 10:22:25,355 INFO L79 Accepts]: Start accepts. Automaton has 68 states and 88 transitions. Word has length 13 [2025-04-30 10:22:25,355 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:25,355 INFO L485 AbstractCegarLoop]: Abstraction has 68 states and 88 transitions. [2025-04-30 10:22:25,355 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:25,355 INFO L278 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2025-04-30 10:22:25,356 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-30 10:22:25,356 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:25,356 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:25,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:22:25,560 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:25,560 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-30 10:22:25,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:25,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1188139860, now seen corresponding path program 1 times [2025-04-30 10:22:25,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:25,561 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413136567] [2025-04-30 10:22:25,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:25,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:25,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-30 10:22:25,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-30 10:22:25,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:25,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:22:25,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:25,632 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413136567] [2025-04-30 10:22:25,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413136567] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:25,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:22:25,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:22:25,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323365408] [2025-04-30 10:22:25,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:25,634 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:22:25,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:25,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:22:25,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:22:25,635 INFO L87 Difference]: Start difference. First operand 68 states and 88 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:25,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:25,647 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2025-04-30 10:22:25,647 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:22:25,648 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-30 10:22:25,648 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:25,648 INFO L225 Difference]: With dead ends: 68 [2025-04-30 10:22:25,648 INFO L226 Difference]: Without dead ends: 67 [2025-04-30 10:22:25,648 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:22:25,649 INFO L437 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:25,649 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:22:25,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-04-30 10:22:25,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2025-04-30 10:22:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 58 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:22:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2025-04-30 10:22:25,659 INFO L79 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 14 [2025-04-30 10:22:25,659 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:25,659 INFO L485 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2025-04-30 10:22:25,660 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:25,660 INFO L278 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2025-04-30 10:22:25,660 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-30 10:22:25,660 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:25,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:25,660 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:22:25,660 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-30 10:22:25,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:25,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1841620274, now seen corresponding path program 1 times [2025-04-30 10:22:25,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:25,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934731584] [2025-04-30 10:22:25,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:25,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:25,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:22:25,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:22:25,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:25,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:25,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:25,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:25,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934731584] [2025-04-30 10:22:25,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934731584] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:25,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077182558] [2025-04-30 10:22:25,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:25,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:25,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:25,748 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:22:25,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:22:25,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:22:25,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:22:25,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:25,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:25,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:22:25,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:25,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:25,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:22:25,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:25,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077182558] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:22:25,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:22:25,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-30 10:22:25,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964948932] [2025-04-30 10:22:25,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:22:25,880 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:22:25,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:25,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:22:25,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:22:25,882 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:25,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:25,915 INFO L93 Difference]: Finished difference Result 136 states and 180 transitions. [2025-04-30 10:22:25,916 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:22:25,917 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-30 10:22:25,917 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:25,918 INFO L225 Difference]: With dead ends: 136 [2025-04-30 10:22:25,918 INFO L226 Difference]: Without dead ends: 75 [2025-04-30 10:22:25,919 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:22:25,920 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:25,920 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:22:25,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-30 10:22:25,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-04-30 10:22:25,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 70 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:22:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2025-04-30 10:22:25,930 INFO L79 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 19 [2025-04-30 10:22:25,930 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:25,930 INFO L485 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2025-04-30 10:22:25,930 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:25,930 INFO L278 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2025-04-30 10:22:25,930 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-30 10:22:25,930 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:25,930 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:25,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:22:26,131 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:26,131 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-30 10:22:26,131 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:26,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1680847630, now seen corresponding path program 2 times [2025-04-30 10:22:26,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:26,132 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905647961] [2025-04-30 10:22:26,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:22:26,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:26,150 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-30 10:22:26,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 25 statements. [2025-04-30 10:22:26,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:22:26,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-30 10:22:26,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:26,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905647961] [2025-04-30 10:22:26,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905647961] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:26,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:22:26,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:22:26,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447275074] [2025-04-30 10:22:26,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:26,262 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:22:26,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:26,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:22:26,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:22:26,263 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:26,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:26,336 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2025-04-30 10:22:26,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:22:26,336 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-30 10:22:26,336 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:26,337 INFO L225 Difference]: With dead ends: 99 [2025-04-30 10:22:26,337 INFO L226 Difference]: Without dead ends: 98 [2025-04-30 10:22:26,337 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:22:26,337 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:26,338 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 115 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:22:26,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-04-30 10:22:26,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2025-04-30 10:22:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 84 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:22:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 114 transitions. [2025-04-30 10:22:26,348 INFO L79 Accepts]: Start accepts. Automaton has 89 states and 114 transitions. Word has length 25 [2025-04-30 10:22:26,348 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:26,348 INFO L485 AbstractCegarLoop]: Abstraction has 89 states and 114 transitions. [2025-04-30 10:22:26,348 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:26,348 INFO L278 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2025-04-30 10:22:26,348 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:22:26,348 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:26,348 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:26,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:22:26,349 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-30 10:22:26,349 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:26,349 INFO L85 PathProgramCache]: Analyzing trace with hash -566668900, now seen corresponding path program 1 times [2025-04-30 10:22:26,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:26,349 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174562655] [2025-04-30 10:22:26,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:26,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:26,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:22:26,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:22:26,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:26,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:26,488 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:26,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:26,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174562655] [2025-04-30 10:22:26,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174562655] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:26,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757390563] [2025-04-30 10:22:26,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:26,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:26,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:26,491 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:22:26,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:22:26,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-30 10:22:26,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-30 10:22:26,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:26,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:26,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:22:26,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:26,630 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:26,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:22:26,713 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:26,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757390563] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:22:26,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:22:26,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-30 10:22:26,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974086462] [2025-04-30 10:22:26,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:22:26,717 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:22:26,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:26,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:22:26,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:22:26,717 INFO L87 Difference]: Start difference. First operand 89 states and 114 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:26,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:26,777 INFO L93 Difference]: Finished difference Result 200 states and 260 transitions. [2025-04-30 10:22:26,778 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:22:26,778 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-30 10:22:26,778 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:26,778 INFO L225 Difference]: With dead ends: 200 [2025-04-30 10:22:26,778 INFO L226 Difference]: Without dead ends: 113 [2025-04-30 10:22:26,779 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:22:26,779 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:26,780 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:22:26,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-04-30 10:22:26,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-04-30 10:22:26,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 105 states have (on average 1.276190476190476) internal successors, (134), 108 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:22:26,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2025-04-30 10:22:26,810 INFO L79 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 26 [2025-04-30 10:22:26,810 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:26,810 INFO L485 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2025-04-30 10:22:26,810 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:26,810 INFO L278 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2025-04-30 10:22:26,811 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-30 10:22:26,811 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:26,811 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:26,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-30 10:22:27,011 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:27,011 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-30 10:22:27,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:27,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1040769564, now seen corresponding path program 2 times [2025-04-30 10:22:27,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:27,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209772994] [2025-04-30 10:22:27,012 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:22:27,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:27,027 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-30 10:22:27,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 38 statements. [2025-04-30 10:22:27,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:22:27,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-04-30 10:22:27,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:27,121 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209772994] [2025-04-30 10:22:27,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209772994] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:27,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:22:27,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:22:27,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139366059] [2025-04-30 10:22:27,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:27,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:22:27,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:27,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:22:27,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:22:27,122 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:27,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:27,177 INFO L93 Difference]: Finished difference Result 122 states and 150 transitions. [2025-04-30 10:22:27,177 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:22:27,177 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-30 10:22:27,177 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:27,178 INFO L225 Difference]: With dead ends: 122 [2025-04-30 10:22:27,178 INFO L226 Difference]: Without dead ends: 121 [2025-04-30 10:22:27,178 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:22:27,178 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:27,179 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 116 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:22:27,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-04-30 10:22:27,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2025-04-30 10:22:27,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 107 states have (on average 1.2710280373831775) internal successors, (136), 110 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:22:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 140 transitions. [2025-04-30 10:22:27,186 INFO L79 Accepts]: Start accepts. Automaton has 115 states and 140 transitions. Word has length 38 [2025-04-30 10:22:27,186 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:27,186 INFO L485 AbstractCegarLoop]: Abstraction has 115 states and 140 transitions. [2025-04-30 10:22:27,186 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:27,186 INFO L278 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2025-04-30 10:22:27,186 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-30 10:22:27,186 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:27,186 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:27,187 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:22:27,187 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-30 10:22:27,187 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:27,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1040837122, now seen corresponding path program 1 times [2025-04-30 10:22:27,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:27,187 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859953049] [2025-04-30 10:22:27,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:27,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:27,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-30 10:22:27,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:22:27,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:27,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:27,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:27,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859953049] [2025-04-30 10:22:27,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859953049] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:27,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188627896] [2025-04-30 10:22:27,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:27,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:27,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:27,472 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:22:27,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:22:27,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-30 10:22:27,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:22:27,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:27,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:27,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-30 10:22:27,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:27,658 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:27,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:22:27,908 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:27,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188627896] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:22:27,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:22:27,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-04-30 10:22:27,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137029296] [2025-04-30 10:22:27,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:22:27,909 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-30 10:22:27,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:27,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-30 10:22:27,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-04-30 10:22:27,910 INFO L87 Difference]: Start difference. First operand 115 states and 140 transitions. Second operand has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:27,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:27,973 INFO L93 Difference]: Finished difference Result 276 states and 344 transitions. [2025-04-30 10:22:27,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-30 10:22:27,973 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-30 10:22:27,973 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:27,974 INFO L225 Difference]: With dead ends: 276 [2025-04-30 10:22:27,974 INFO L226 Difference]: Without dead ends: 163 [2025-04-30 10:22:27,975 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-04-30 10:22:27,975 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:27,975 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 415 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:22:27,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-04-30 10:22:27,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-04-30 10:22:27,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 155 states have (on average 1.1870967741935483) internal successors, (184), 158 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:22:27,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 188 transitions. [2025-04-30 10:22:27,983 INFO L79 Accepts]: Start accepts. Automaton has 163 states and 188 transitions. Word has length 38 [2025-04-30 10:22:27,983 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:27,983 INFO L485 AbstractCegarLoop]: Abstraction has 163 states and 188 transitions. [2025-04-30 10:22:27,983 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:27,983 INFO L278 IsEmpty]: Start isEmpty. Operand 163 states and 188 transitions. [2025-04-30 10:22:27,984 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-04-30 10:22:27,985 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:27,985 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:27,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:22:28,185 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:28,185 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-30 10:22:28,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:28,186 INFO L85 PathProgramCache]: Analyzing trace with hash 986368770, now seen corresponding path program 2 times [2025-04-30 10:22:28,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:28,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996136693] [2025-04-30 10:22:28,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:22:28,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:28,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-04-30 10:22:28,218 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 62 statements. [2025-04-30 10:22:28,218 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:22:28,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:28,340 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-04-30 10:22:28,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:28,341 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996136693] [2025-04-30 10:22:28,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996136693] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:28,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:22:28,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:22:28,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464973930] [2025-04-30 10:22:28,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:28,341 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:22:28,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:28,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:22:28,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:22:28,342 INFO L87 Difference]: Start difference. First operand 163 states and 188 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:28,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:28,441 INFO L93 Difference]: Finished difference Result 175 states and 204 transitions. [2025-04-30 10:22:28,441 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:22:28,441 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-04-30 10:22:28,441 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:28,442 INFO L225 Difference]: With dead ends: 175 [2025-04-30 10:22:28,442 INFO L226 Difference]: Without dead ends: 173 [2025-04-30 10:22:28,443 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:22:28,443 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 37 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:28,443 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 115 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:22:28,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-04-30 10:22:28,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2025-04-30 10:22:28,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 163 states have (on average 1.1901840490797546) internal successors, (194), 166 states have internal predecessors, (194), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:22:28,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 198 transitions. [2025-04-30 10:22:28,450 INFO L79 Accepts]: Start accepts. Automaton has 171 states and 198 transitions. Word has length 62 [2025-04-30 10:22:28,450 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:28,450 INFO L485 AbstractCegarLoop]: Abstraction has 171 states and 198 transitions. [2025-04-30 10:22:28,450 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:28,451 INFO L278 IsEmpty]: Start isEmpty. Operand 171 states and 198 transitions. [2025-04-30 10:22:28,451 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-04-30 10:22:28,451 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:28,452 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:28,452 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:22:28,452 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-30 10:22:28,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:28,452 INFO L85 PathProgramCache]: Analyzing trace with hash 808731142, now seen corresponding path program 1 times [2025-04-30 10:22:28,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:28,452 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357844069] [2025-04-30 10:22:28,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:28,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:28,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-30 10:22:28,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-30 10:22:28,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:28,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:29,228 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:22:29,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:29,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357844069] [2025-04-30 10:22:29,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357844069] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:29,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974828560] [2025-04-30 10:22:29,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:29,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:29,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:29,230 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:22:29,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:22:29,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-30 10:22:29,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-30 10:22:29,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:29,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:29,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-30 10:22:29,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:29,481 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:22:29,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:22:30,021 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:22:30,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974828560] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:22:30,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:22:30,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 43 [2025-04-30 10:22:30,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600175639] [2025-04-30 10:22:30,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:22:30,022 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-30 10:22:30,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:30,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-30 10:22:30,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2025-04-30 10:22:30,025 INFO L87 Difference]: Start difference. First operand 171 states and 198 transitions. Second operand has 43 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 43 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:30,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:30,112 INFO L93 Difference]: Finished difference Result 370 states and 436 transitions. [2025-04-30 10:22:30,112 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-30 10:22:30,113 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 43 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-04-30 10:22:30,113 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:30,114 INFO L225 Difference]: With dead ends: 370 [2025-04-30 10:22:30,114 INFO L226 Difference]: Without dead ends: 201 [2025-04-30 10:22:30,115 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 105 SyntacticMatches, 23 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1198 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2025-04-30 10:22:30,115 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:30,115 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:22:30,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-04-30 10:22:30,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-04-30 10:22:30,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 193 states have (on average 1.160621761658031) internal successors, (224), 196 states have internal predecessors, (224), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-30 10:22:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 228 transitions. [2025-04-30 10:22:30,123 INFO L79 Accepts]: Start accepts. Automaton has 201 states and 228 transitions. Word has length 69 [2025-04-30 10:22:30,123 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:30,123 INFO L485 AbstractCegarLoop]: Abstraction has 201 states and 228 transitions. [2025-04-30 10:22:30,123 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 43 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:30,123 INFO L278 IsEmpty]: Start isEmpty. Operand 201 states and 228 transitions. [2025-04-30 10:22:30,124 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-04-30 10:22:30,124 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:30,124 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:30,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-30 10:22:30,328 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-30 10:22:30,328 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-04-30 10:22:30,328 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:30,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1301368752, now seen corresponding path program 2 times [2025-04-30 10:22:30,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:30,328 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72480839] [2025-04-30 10:22:30,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:22:30,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:30,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 84 statements into 2 equivalence classes. [2025-04-30 10:22:30,409 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 84 of 84 statements. [2025-04-30 10:22:30,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:22:30,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:22:30,409 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:22:30,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-04-30 10:22:30,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-04-30 10:22:30,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:30,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:22:30,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:22:30,510 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:22:30,511 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-04-30 10:22:30,512 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-04-30 10:22:30,513 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-04-30 10:22:30,513 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-04-30 10:22:30,513 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-04-30 10:22:30,513 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-04-30 10:22:30,513 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:22:30,515 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1] [2025-04-30 10:22:30,569 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:22:30,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:22:30 BoogieIcfgContainer [2025-04-30 10:22:30,571 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:22:30,571 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:22:30,572 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:22:30,572 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:22:30,573 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:22:24" (3/4) ... [2025-04-30 10:22:30,574 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-30 10:22:30,635 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 28. [2025-04-30 10:22:30,683 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:22:30,683 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:22:30,683 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:22:30,684 INFO L158 Benchmark]: Toolchain (without parser) took 7191.61ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 110.6MB in the beginning and 119.9MB in the end (delta: -9.3MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2025-04-30 10:22:30,684 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 226.5MB. Free memory is still 149.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:22:30,684 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.65ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 89.5MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:22:30,685 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.24ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 87.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:22:30,685 INFO L158 Benchmark]: Boogie Preprocessor took 60.26ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 84.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:22:30,685 INFO L158 Benchmark]: RCFGBuilder took 382.88ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 62.7MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:22:30,685 INFO L158 Benchmark]: TraceAbstraction took 6213.76ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 62.2MB in the beginning and 128.3MB in the end (delta: -66.1MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. [2025-04-30 10:22:30,685 INFO L158 Benchmark]: Witness Printer took 112.15ms. Allocated memory is still 176.2MB. Free memory was 128.3MB in the beginning and 119.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:22:30,686 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49ms. Allocated memory is still 226.5MB. Free memory is still 149.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.65ms. Allocated memory is still 142.6MB. Free memory was 110.6MB in the beginning and 89.5MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.24ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 87.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.26ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 84.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 382.88ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 62.7MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6213.76ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 62.2MB in the beginning and 128.3MB in the end (delta: -66.1MB). Peak memory consumption was 51.0MB. Max. memory is 16.1GB. * Witness Printer took 112.15ms. Allocated memory is still 176.2MB. Free memory was 128.3MB in the beginning and 119.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 564]: integer overflow possible integer overflow possible We found a FailurePath: [L597] struct node_t *list = ((void *)0); [L597] struct node_t *list = ((void *)0); [L598] int dataNotFinished = 0; VAL [list={3:0}] [L600] CALL append(&list) [L587] struct node_t *node = malloc(sizeof *node); [L588] EXPR \read(**pointerToList) [L588] node->next = *pointerToList [L589] EXPR \read(**pointerToList) [L589] COND TRUE *pointerToList == ((void *)0) [L590] CALL create_data(((void *)0)) VAL [\at(prevData, Pre)={0:0}] [L552] prevData != ((void *)0) && prevData->hasNextPartReference VAL [\at(prevData, Pre)={0:0}, prevData={0:0}] [L552] prevData != ((void *)0) && prevData->hasNextPartReference VAL [\at(prevData, Pre)={0:0}, prevData={0:0}] [L552] COND FALSE !(prevData != ((void *)0) && prevData->hasNextPartReference) [L555] Data data = malloc(sizeof *data); [L556] data->array = (int*) malloc(20 * sizeof(data->array)) [L557] int counter = 0; [L558] counter = 0 VAL [\at(prevData, Pre)={0:0}, counter=0, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\at(prevData, Pre)={0:0}, counter=1, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\at(prevData, Pre)={0:0}, counter=2, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\at(prevData, Pre)={0:0}, counter=3, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\at(prevData, Pre)={0:0}, counter=4, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\at(prevData, Pre)={0:0}, counter=5, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\at(prevData, Pre)={0:0}, counter=6, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\at(prevData, Pre)={0:0}, counter=7, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\at(prevData, Pre)={0:0}, counter=8, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\at(prevData, Pre)={0:0}, counter=9, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\at(prevData, Pre)={0:0}, counter=10, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\at(prevData, Pre)={0:0}, counter=11, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\at(prevData, Pre)={0:0}, counter=12, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\at(prevData, Pre)={0:0}, counter=13, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\at(prevData, Pre)={0:0}, counter=14, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\at(prevData, Pre)={0:0}, counter=15, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\at(prevData, Pre)={0:0}, counter=16, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\at(prevData, Pre)={0:0}, counter=17, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\at(prevData, Pre)={0:0}, counter=18, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\at(prevData, Pre)={0:0}, counter=19, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 20 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\at(prevData, Pre)={0:0}, counter=20, data={-4:0}, prevData={0:0}] [L558] COND FALSE !(counter < 20) [L561] data->number = 0 [L562] int userInput = __VERIFIER_nondet_int(); [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [\at(prevData, Pre)={0:0}, data={-4:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 [L563] EXPR data->number [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [\at(prevData, Pre)={0:0}, data={-4:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\at(prevData, Pre)={0:0}, data={-4:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L563] EXPR data->number [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\at(prevData, Pre)={0:0}, data={-4:0}, prevData={0:0}, userInput=0] [L563] COND TRUE __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200 [L564] EXPR data->number [L564] EXPR data->number + __VERIFIER_nondet_int() [L564] data->number = data->number + __VERIFIER_nondet_int() [L565] userInput = __VERIFIER_nondet_int() [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [\at(prevData, Pre)={0:0}, data={-4:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 [L563] EXPR data->number [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [\at(prevData, Pre)={0:0}, data={-4:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\at(prevData, Pre)={0:0}, data={-4:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 [L563] EXPR data->number [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\at(prevData, Pre)={0:0}, data={-4:0}, prevData={0:0}, userInput=0] [L563] COND TRUE __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 && userInput < 200 && userInput > -200 [L564] EXPR data->number [L564] data->number + __VERIFIER_nondet_int() VAL [\at(prevData, Pre)={0:0}, data={-4:0}, prevData={0:0}] - UnprovableResult [Line: 558]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 564]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 66 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 12, TraceHistogramMax: 20, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 93 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 2178 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1667 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 351 IncrementalHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 511 mSDtfsCounter, 351 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 401 GetRequests, 258 SyntacticMatches, 23 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=201occurred in iteration=11, InterpolantAutomatonStates: 125, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 27 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 576 NumberOfCodeBlocks, 501 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 624 ConstructedInterpolants, 0 QuantifiedInterpolants, 1403 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1434 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 440/1681 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-30 10:22:30,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)