./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.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 1489855b7530896bdd176b2b4b6c40b97d8289986908954c704880efe20dffb0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 13:07:28,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 13:07:28,310 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-13 13:07:28,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 13:07:28,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 13:07:28,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 13:07:28,353 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 13:07:28,353 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 13:07:28,354 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 13:07:28,355 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 13:07:28,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 13:07:28,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 13:07:28,355 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 13:07:28,357 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 13:07:28,357 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 13:07:28,357 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 13:07:28,358 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 13:07:28,358 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 13:07:28,358 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 13:07:28,358 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 13:07:28,358 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 13:07:28,359 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 13:07:28,361 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 13:07:28,362 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 13:07:28,362 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 13:07:28,362 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 13:07:28,362 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 13:07:28,362 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 13:07:28,362 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 13:07:28,363 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 13:07:28,363 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 13:07:28,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 13:07:28,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 13:07:28,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 13:07:28,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:07:28,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 13:07:28,364 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 13:07:28,364 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 13:07:28,364 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 13:07:28,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 13:07:28,364 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 13:07:28,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 13:07:28,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 13:07:28,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 13:07:28,366 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 1489855b7530896bdd176b2b4b6c40b97d8289986908954c704880efe20dffb0 [2024-10-13 13:07:28,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 13:07:28,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 13:07:28,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 13:07:28,609 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 13:07:28,610 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 13:07:28,611 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i [2024-10-13 13:07:29,988 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 13:07:30,202 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 13:07:30,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i [2024-10-13 13:07:30,217 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fd4341e4/0fb47f5280624839920d6fa778192cda/FLAG92209441b [2024-10-13 13:07:30,231 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fd4341e4/0fb47f5280624839920d6fa778192cda [2024-10-13 13:07:30,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 13:07:30,235 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 13:07:30,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 13:07:30,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 13:07:30,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 13:07:30,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:07:30" (1/1) ... [2024-10-13 13:07:30,244 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@669e09f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:07:30, skipping insertion in model container [2024-10-13 13:07:30,245 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:07:30" (1/1) ... [2024-10-13 13:07:30,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 13:07:30,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:07:30,538 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 13:07:30,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 13:07:30,591 INFO L204 MainTranslator]: Completed translation [2024-10-13 13:07:30,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:07:30 WrapperNode [2024-10-13 13:07:30,592 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 13:07:30,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 13:07:30,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 13:07:30,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 13:07:30,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:07:30" (1/1) ... [2024-10-13 13:07:30,615 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:07:30" (1/1) ... [2024-10-13 13:07:30,630 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2024-10-13 13:07:30,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 13:07:30,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 13:07:30,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 13:07:30,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 13:07:30,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:07:30" (1/1) ... [2024-10-13 13:07:30,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:07:30" (1/1) ... [2024-10-13 13:07:30,643 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:07:30" (1/1) ... [2024-10-13 13:07:30,666 INFO L175 MemorySlicer]: Split 44 memory accesses to 3 slices as follows [2, 11, 31]. 70 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 18 writes are split as follows [0, 2, 16]. [2024-10-13 13:07:30,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:07:30" (1/1) ... [2024-10-13 13:07:30,667 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:07:30" (1/1) ... [2024-10-13 13:07:30,674 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:07:30" (1/1) ... [2024-10-13 13:07:30,676 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:07:30" (1/1) ... [2024-10-13 13:07:30,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:07:30" (1/1) ... [2024-10-13 13:07:30,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:07:30" (1/1) ... [2024-10-13 13:07:30,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 13:07:30,686 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 13:07:30,686 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 13:07:30,686 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 13:07:30,687 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:07:30" (1/1) ... [2024-10-13 13:07:30,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 13:07:30,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:07:30,719 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) [2024-10-13 13:07:30,725 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 [2024-10-13 13:07:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 13:07:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 13:07:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 13:07:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 13:07:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 13:07:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 13:07:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 13:07:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2024-10-13 13:07:30,767 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2024-10-13 13:07:30,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 13:07:30,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 13:07:30,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 13:07:30,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 13:07:30,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 13:07:30,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 13:07:30,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 13:07:30,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 13:07:30,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 13:07:30,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-13 13:07:30,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-13 13:07:30,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-13 13:07:30,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 13:07:30,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 13:07:30,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 13:07:30,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 13:07:30,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 13:07:30,884 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 13:07:30,886 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 13:07:31,178 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-10-13 13:07:31,178 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 13:07:31,216 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 13:07:31,216 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-13 13:07:31,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:07:31 BoogieIcfgContainer [2024-10-13 13:07:31,217 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 13:07:31,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 13:07:31,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 13:07:31,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 13:07:31,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:07:30" (1/3) ... [2024-10-13 13:07:31,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66cee237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:07:31, skipping insertion in model container [2024-10-13 13:07:31,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:07:30" (2/3) ... [2024-10-13 13:07:31,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66cee237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:07:31, skipping insertion in model container [2024-10-13 13:07:31,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:07:31" (3/3) ... [2024-10-13 13:07:31,224 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-1.i [2024-10-13 13:07:31,237 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 13:07:31,237 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-13 13:07:31,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 13:07:31,298 INFO L333 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;@7f91402, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 13:07:31,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-13 13:07:31,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 40 states have internal predecessors, (57), 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) [2024-10-13 13:07:31,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 13:07:31,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:07:31,308 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:07:31,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 13:07:31,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:07:31,314 INFO L85 PathProgramCache]: Analyzing trace with hash 522260276, now seen corresponding path program 1 times [2024-10-13 13:07:31,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:07:31,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930137275] [2024-10-13 13:07:31,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:07:31,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:07:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:07:31,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:07:31,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:07:31,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930137275] [2024-10-13 13:07:31,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930137275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:07:31,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:07:31,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 13:07:31,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538495878] [2024-10-13 13:07:31,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:07:31,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:07:31,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:07:31,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:07:31,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:07:31,669 INFO L87 Difference]: Start difference. First operand has 44 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 40 states have internal predecessors, (57), 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, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-10-13 13:07:31,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:07:31,729 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2024-10-13 13:07:31,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:07:31,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2024-10-13 13:07:31,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:07:31,735 INFO L225 Difference]: With dead ends: 116 [2024-10-13 13:07:31,735 INFO L226 Difference]: Without dead ends: 69 [2024-10-13 13:07:31,738 INFO L431 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 [2024-10-13 13:07:31,740 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 33 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:07:31,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 138 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:07:31,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-13 13:07:31,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2024-10-13 13:07:31,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 53 states have (on average 1.509433962264151) internal successors, (80), 58 states have internal predecessors, (80), 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) [2024-10-13 13:07:31,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 84 transitions. [2024-10-13 13:07:31,768 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 84 transitions. Word has length 9 [2024-10-13 13:07:31,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:07:31,768 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 84 transitions. [2024-10-13 13:07:31,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2024-10-13 13:07:31,768 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 84 transitions. [2024-10-13 13:07:31,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 13:07:31,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:07:31,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:07:31,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 13:07:31,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 13:07:31,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:07:31,770 INFO L85 PathProgramCache]: Analyzing trace with hash 522319858, now seen corresponding path program 1 times [2024-10-13 13:07:31,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:07:31,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510103819] [2024-10-13 13:07:31,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:07:31,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:07:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:07:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:07:31,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:07:31,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510103819] [2024-10-13 13:07:31,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510103819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:07:31,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:07:31,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 13:07:31,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405940198] [2024-10-13 13:07:31,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:07:31,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 13:07:31,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:07:31,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 13:07:31,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 13:07:31,835 INFO L87 Difference]: Start difference. First operand 63 states and 84 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2024-10-13 13:07:31,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:07:31,861 INFO L93 Difference]: Finished difference Result 131 states and 181 transitions. [2024-10-13 13:07:31,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:07:31,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 9 [2024-10-13 13:07:31,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:07:31,863 INFO L225 Difference]: With dead ends: 131 [2024-10-13 13:07:31,863 INFO L226 Difference]: Without dead ends: 69 [2024-10-13 13:07:31,863 INFO L431 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 [2024-10-13 13:07:31,864 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:07:31,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 131 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:07:31,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-13 13:07:31,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-13 13:07:31,869 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) [2024-10-13 13:07:31,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2024-10-13 13:07:31,870 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 9 [2024-10-13 13:07:31,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:07:31,871 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2024-10-13 13:07:31,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2024-10-13 13:07:31,871 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2024-10-13 13:07:31,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 13:07:31,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:07:31,872 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:07:31,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 13:07:31,872 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 13:07:31,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:07:31,872 INFO L85 PathProgramCache]: Analyzing trace with hash -235566390, now seen corresponding path program 1 times [2024-10-13 13:07:31,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:07:31,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206705843] [2024-10-13 13:07:31,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:07:31,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:07:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:07:31,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:07:31,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:07:31,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206705843] [2024-10-13 13:07:31,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206705843] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:07:31,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078073527] [2024-10-13 13:07:31,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:07:31,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:07:31,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:07:31,958 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) [2024-10-13 13:07:31,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 13:07:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:07:32,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 13:07:32,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:07:32,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:07:32,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 13:07:32,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078073527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:07:32,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 13:07:32,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-10-13 13:07:32,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119230438] [2024-10-13 13:07:32,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:07:32,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 13:07:32,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:07:32,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 13:07:32,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 13:07:32,138 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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) [2024-10-13 13:07:32,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:07:32,177 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2024-10-13 13:07:32,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 13:07:32,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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 12 [2024-10-13 13:07:32,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:07:32,180 INFO L225 Difference]: With dead ends: 69 [2024-10-13 13:07:32,180 INFO L226 Difference]: Without dead ends: 68 [2024-10-13 13:07:32,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 13:07:32,181 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 1 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:07:32,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 167 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:07:32,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-13 13:07:32,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-13 13:07:32,188 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) [2024-10-13 13:07:32,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 88 transitions. [2024-10-13 13:07:32,189 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 88 transitions. Word has length 12 [2024-10-13 13:07:32,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:07:32,189 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 88 transitions. [2024-10-13 13:07:32,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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) [2024-10-13 13:07:32,189 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2024-10-13 13:07:32,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 13:07:32,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:07:32,190 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:07:32,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 13:07:32,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:07:32,395 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 13:07:32,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:07:32,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1287376556, now seen corresponding path program 1 times [2024-10-13 13:07:32,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:07:32,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494342068] [2024-10-13 13:07:32,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:07:32,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:07:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:07:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 13:07:32,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:07:32,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494342068] [2024-10-13 13:07:32,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494342068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:07:32,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:07:32,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 13:07:32,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508720912] [2024-10-13 13:07:32,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:07:32,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 13:07:32,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:07:32,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 13:07:32,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 13:07:32,471 INFO L87 Difference]: Start difference. First operand 68 states and 88 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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) [2024-10-13 13:07:32,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:07:32,486 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2024-10-13 13:07:32,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 13:07:32,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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 [2024-10-13 13:07:32,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:07:32,488 INFO L225 Difference]: With dead ends: 68 [2024-10-13 13:07:32,488 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 13:07:32,488 INFO L431 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 [2024-10-13 13:07:32,490 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 13:07:32,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:07:32,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 13:07:32,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2024-10-13 13:07:32,495 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) [2024-10-13 13:07:32,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2024-10-13 13:07:32,496 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 13 [2024-10-13 13:07:32,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:07:32,496 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2024-10-13 13:07:32,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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) [2024-10-13 13:07:32,496 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2024-10-13 13:07:32,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 13:07:32,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:07:32,497 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:07:32,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 13:07:32,497 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 13:07:32,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:07:32,498 INFO L85 PathProgramCache]: Analyzing trace with hash 2078542808, now seen corresponding path program 1 times [2024-10-13 13:07:32,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:07:32,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449255469] [2024-10-13 13:07:32,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:07:32,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:07:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:07:32,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:07:32,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:07:32,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449255469] [2024-10-13 13:07:32,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449255469] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:07:32,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295883877] [2024-10-13 13:07:32,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:07:32,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:07:32,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:07:32,587 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) [2024-10-13 13:07:32,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 13:07:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:07:32,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 13:07:32,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:07:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:07:32,711 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:07:32,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 13:07:32,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295883877] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:07:32,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:07:32,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-10-13 13:07:32,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565975510] [2024-10-13 13:07:32,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:07:32,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 13:07:32,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:07:32,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 13:07:32,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:07:32,736 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2024-10-13 13:07:32,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:07:32,761 INFO L93 Difference]: Finished difference Result 137 states and 181 transitions. [2024-10-13 13:07:32,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 13:07:32,762 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 18 [2024-10-13 13:07:32,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:07:32,764 INFO L225 Difference]: With dead ends: 137 [2024-10-13 13:07:32,765 INFO L226 Difference]: Without dead ends: 75 [2024-10-13 13:07:32,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 13:07:32,766 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 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 [2024-10-13 13:07:32,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 13:07:32,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-13 13:07:32,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-13 13:07:32,777 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) [2024-10-13 13:07:32,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2024-10-13 13:07:32,778 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 18 [2024-10-13 13:07:32,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:07:32,778 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2024-10-13 13:07:32,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2024-10-13 13:07:32,778 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2024-10-13 13:07:32,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 13:07:32,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:07:32,779 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:07:32,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 13:07:32,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:07:32,980 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 13:07:32,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:07:32,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1300380376, now seen corresponding path program 2 times [2024-10-13 13:07:32,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:07:32,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900641873] [2024-10-13 13:07:32,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:07:32,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:07:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:07:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:07:33,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:07:33,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900641873] [2024-10-13 13:07:33,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900641873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:07:33,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:07:33,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 13:07:33,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810423701] [2024-10-13 13:07:33,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:07:33,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:07:33,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:07:33,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:07:33,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:07:33,163 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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) [2024-10-13 13:07:33,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:07:33,237 INFO L93 Difference]: Finished difference Result 103 states and 132 transitions. [2024-10-13 13:07:33,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:07:33,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 24 [2024-10-13 13:07:33,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:07:33,239 INFO L225 Difference]: With dead ends: 103 [2024-10-13 13:07:33,239 INFO L226 Difference]: Without dead ends: 102 [2024-10-13 13:07:33,239 INFO L431 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 [2024-10-13 13:07:33,240 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 24 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:07:33,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 106 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:07:33,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-13 13:07:33,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 87. [2024-10-13 13:07:33,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 82 states have internal predecessors, (108), 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) [2024-10-13 13:07:33,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2024-10-13 13:07:33,246 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 24 [2024-10-13 13:07:33,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:07:33,247 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2024-10-13 13:07:33,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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) [2024-10-13 13:07:33,247 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2024-10-13 13:07:33,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 13:07:33,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:07:33,248 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:07:33,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 13:07:33,248 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 13:07:33,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:07:33,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1657086077, now seen corresponding path program 1 times [2024-10-13 13:07:33,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:07:33,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989966946] [2024-10-13 13:07:33,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:07:33,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:07:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:07:33,376 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:07:33,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:07:33,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989966946] [2024-10-13 13:07:33,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989966946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:07:33,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:07:33,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 13:07:33,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355998550] [2024-10-13 13:07:33,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:07:33,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:07:33,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:07:33,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:07:33,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:07:33,378 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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) [2024-10-13 13:07:33,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:07:33,471 INFO L93 Difference]: Finished difference Result 102 states and 130 transitions. [2024-10-13 13:07:33,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 13:07:33,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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 [2024-10-13 13:07:33,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:07:33,472 INFO L225 Difference]: With dead ends: 102 [2024-10-13 13:07:33,472 INFO L226 Difference]: Without dead ends: 101 [2024-10-13 13:07:33,472 INFO L431 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 [2024-10-13 13:07:33,473 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 12 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:07:33,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 138 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:07:33,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-13 13:07:33,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2024-10-13 13:07:33,478 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) [2024-10-13 13:07:33,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 114 transitions. [2024-10-13 13:07:33,479 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 114 transitions. Word has length 25 [2024-10-13 13:07:33,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:07:33,479 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 114 transitions. [2024-10-13 13:07:33,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 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) [2024-10-13 13:07:33,479 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2024-10-13 13:07:33,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 13:07:33,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:07:33,480 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:07:33,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 13:07:33,480 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 13:07:33,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:07:33,480 INFO L85 PathProgramCache]: Analyzing trace with hash -974803296, now seen corresponding path program 1 times [2024-10-13 13:07:33,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:07:33,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869268079] [2024-10-13 13:07:33,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:07:33,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:07:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:07:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:07:33,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:07:33,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869268079] [2024-10-13 13:07:33,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869268079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 13:07:33,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 13:07:33,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 13:07:33,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669891128] [2024-10-13 13:07:33,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 13:07:33,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 13:07:33,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:07:33,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 13:07:33,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 13:07:33,798 INFO L87 Difference]: Start difference. First operand 89 states and 114 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2024-10-13 13:07:33,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:07:33,934 INFO L93 Difference]: Finished difference Result 123 states and 156 transitions. [2024-10-13 13:07:33,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 13:07:33,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 27 [2024-10-13 13:07:33,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:07:33,936 INFO L225 Difference]: With dead ends: 123 [2024-10-13 13:07:33,936 INFO L226 Difference]: Without dead ends: 121 [2024-10-13 13:07:33,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 13:07:33,937 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 38 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 13:07:33,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 117 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 13:07:33,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-13 13:07:33,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 99. [2024-10-13 13:07:33,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 94 states have internal predecessors, (122), 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) [2024-10-13 13:07:33,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 126 transitions. [2024-10-13 13:07:33,956 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 126 transitions. Word has length 27 [2024-10-13 13:07:33,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:07:33,960 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 126 transitions. [2024-10-13 13:07:33,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2024-10-13 13:07:33,960 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 126 transitions. [2024-10-13 13:07:33,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 13:07:33,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:07:33,961 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:07:33,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 13:07:33,962 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 13:07:33,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:07:33,962 INFO L85 PathProgramCache]: Analyzing trace with hash -396517863, now seen corresponding path program 1 times [2024-10-13 13:07:33,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:07:33,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15044723] [2024-10-13 13:07:33,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:07:33,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:07:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:07:34,490 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:07:34,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 13:07:34,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15044723] [2024-10-13 13:07:34,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15044723] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 13:07:34,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31496279] [2024-10-13 13:07:34,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:07:34,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:07:34,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 13:07:34,497 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) [2024-10-13 13:07:34,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 13:07:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 13:07:34,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-13 13:07:34,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 13:07:34,670 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-13 13:07:34,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 13 [2024-10-13 13:07:34,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 13:07:34,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 11 [2024-10-13 13:07:34,740 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-13 13:07:34,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-13 13:07:34,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 13:07:34,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 56 [2024-10-13 13:07:34,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 13:07:34,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 13:07:34,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 13:07:34,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2024-10-13 13:07:34,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2024-10-13 13:07:34,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 13:07:34,950 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:07:34,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 13:07:35,312 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 13:07:35,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 13:07:35,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 60 [2024-10-13 13:07:35,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-10-13 13:07:35,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-10-13 13:07:35,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-10-13 13:07:35,412 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 13:07:35,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31496279] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 13:07:35,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 13:07:35,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 14 [2024-10-13 13:07:35,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193369570] [2024-10-13 13:07:35,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 13:07:35,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 13:07:35,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 13:07:35,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 13:07:35,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=148, Unknown=4, NotChecked=0, Total=210 [2024-10-13 13:07:35,414 INFO L87 Difference]: Start difference. First operand 99 states and 126 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 15 states have internal predecessors, (48), 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) [2024-10-13 13:07:39,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-13 13:07:43,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-13 13:07:47,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-13 13:07:51,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-13 13:07:55,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-13 13:07:57,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 13:07:57,013 INFO L93 Difference]: Finished difference Result 152 states and 192 transitions. [2024-10-13 13:07:57,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 13:07:57,013 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 15 states have internal predecessors, (48), 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 31 [2024-10-13 13:07:57,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 13:07:57,014 INFO L225 Difference]: With dead ends: 152 [2024-10-13 13:07:57,014 INFO L226 Difference]: Without dead ends: 151 [2024-10-13 13:07:57,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=237, Unknown=5, NotChecked=0, Total=342 [2024-10-13 13:07:57,015 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 46 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 8 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.3s IncrementalHoareTripleChecker+Time [2024-10-13 13:07:57,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 349 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 221 Invalid, 16 Unknown, 0 Unchecked, 21.3s Time] [2024-10-13 13:07:57,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-13 13:07:57,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 113. [2024-10-13 13:07:57,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 105 states have (on average 1.3523809523809525) internal successors, (142), 108 states have internal predecessors, (142), 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) [2024-10-13 13:07:57,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2024-10-13 13:07:57,034 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 31 [2024-10-13 13:07:57,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 13:07:57,034 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2024-10-13 13:07:57,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 15 states have internal predecessors, (48), 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) [2024-10-13 13:07:57,034 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2024-10-13 13:07:57,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 13:07:57,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 13:07:57,041 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:07:57,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 13:07:57,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 13:07:57,242 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-10-13 13:07:57,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 13:07:57,243 INFO L85 PathProgramCache]: Analyzing trace with hash -2044961979, now seen corresponding path program 1 times [2024-10-13 13:07:57,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 13:07:57,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992728416] [2024-10-13 13:07:57,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 13:07:57,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 13:07:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 13:07:57,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 13:07:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 13:07:57,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 13:07:57,375 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 13:07:57,375 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-10-13 13:07:57,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-10-13 13:07:57,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-10-13 13:07:57,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-10-13 13:07:57,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-10-13 13:07:57,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-10-13 13:07:57,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 13:07:57,386 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 13:07:57,464 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 13:07:57,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:07:57 BoogieIcfgContainer [2024-10-13 13:07:57,466 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 13:07:57,467 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 13:07:57,467 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 13:07:57,467 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 13:07:57,467 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:07:31" (3/4) ... [2024-10-13 13:07:57,468 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-13 13:07:57,532 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 13:07:57,532 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 13:07:57,533 INFO L158 Benchmark]: Toolchain (without parser) took 27298.45ms. Allocated memory was 228.6MB in the beginning and 304.1MB in the end (delta: 75.5MB). Free memory was 157.5MB in the beginning and 266.6MB in the end (delta: -109.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:07:57,533 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory was 81.9MB in the beginning and 81.8MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 13:07:57,533 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.99ms. Allocated memory is still 228.6MB. Free memory was 157.2MB in the beginning and 137.5MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 13:07:57,533 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.58ms. Allocated memory is still 228.6MB. Free memory was 137.5MB in the beginning and 135.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:07:57,533 INFO L158 Benchmark]: Boogie Preprocessor took 51.09ms. Allocated memory is still 228.6MB. Free memory was 135.4MB in the beginning and 131.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 13:07:57,534 INFO L158 Benchmark]: RCFGBuilder took 531.14ms. Allocated memory is still 228.6MB. Free memory was 131.7MB in the beginning and 183.1MB in the end (delta: -51.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 13:07:57,534 INFO L158 Benchmark]: TraceAbstraction took 26248.32ms. Allocated memory was 228.6MB in the beginning and 304.1MB in the end (delta: 75.5MB). Free memory was 182.0MB in the beginning and 269.7MB in the end (delta: -87.8MB). Peak memory consumption was 168.0MB. Max. memory is 16.1GB. [2024-10-13 13:07:57,534 INFO L158 Benchmark]: Witness Printer took 65.77ms. Allocated memory is still 304.1MB. Free memory was 269.7MB in the beginning and 266.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 13:07:57,542 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.15ms. Allocated memory is still 117.4MB. Free memory was 81.9MB in the beginning and 81.8MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.99ms. Allocated memory is still 228.6MB. Free memory was 157.2MB in the beginning and 137.5MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.58ms. Allocated memory is still 228.6MB. Free memory was 137.5MB in the beginning and 135.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.09ms. Allocated memory is still 228.6MB. Free memory was 135.4MB in the beginning and 131.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 531.14ms. Allocated memory is still 228.6MB. Free memory was 131.7MB in the beginning and 183.1MB in the end (delta: -51.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 26248.32ms. Allocated memory was 228.6MB in the beginning and 304.1MB in the end (delta: 75.5MB). Free memory was 182.0MB in the beginning and 269.7MB in the end (delta: -87.8MB). Peak memory consumption was 168.0MB. Max. memory is 16.1GB. * Witness Printer took 65.77ms. Allocated memory is still 304.1MB. Free memory was 269.7MB in the beginning and 266.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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: [L598] struct node_t *list = ((void *)0); [L598] struct node_t *list = ((void *)0); [L599] int dataNotFinished = 0; VAL [list={3:0}] [L601] CALL append(&list) [L588] struct node_t *node = malloc(sizeof *node); [L589] EXPR \read(**pointerToList) [L589] node->next = *pointerToList [L590] EXPR \read(**pointerToList) [L590] COND TRUE *pointerToList == ((void *)0) [L591] CALL create_data(((void *)0)) VAL [\old(prevData)={0:0}] [L552] prevData != ((void *)0) && prevData->hasNextPartReference VAL [\old(prevData)={0:0}, prevData={0:0}] [L552] prevData != ((void *)0) && prevData->hasNextPartReference VAL [\old(prevData)={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 [\old(prevData)={0:0}, counter=0, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 3 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=1, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 3 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=2, data={-4:0}, prevData={0:0}] [L558] COND TRUE counter < 3 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [\old(prevData)={0:0}, counter=3, data={-4:0}, prevData={0:0}] [L558] COND FALSE !(counter < 3) VAL [\old(prevData)={0:0}, data={-4:0}, prevData={0:0}] [L561] data->number = 0 [L562] int userInput = __VERIFIER_nondet_int(); [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [\old(prevData)={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 [\old(prevData)={0:0}, data={-4:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\old(prevData)={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 [\old(prevData)={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 [\old(prevData)={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 [\old(prevData)={0:0}, data={-4:0}, prevData={0:0}, userInput=0] [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 && data->number > -200 VAL [\old(prevData)={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 [\old(prevData)={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 [\old(prevData)={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: 573]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 573]: 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, 44 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 26.1s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 22.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 16 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 21.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 155 mSDsluCounter, 1402 SdHoareTripleChecker+Invalid, 21.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1020 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 501 IncrementalHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 382 mSDtfsCounter, 501 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=9, InterpolantAutomatonStates: 52, 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, 9 MinimizatonAttempts, 97 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 264 ConstructedInterpolants, 27 QuantifiedInterpolants, 2018 SizeOfPredicates, 9 NumberOfNonLiveVariables, 724 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 77/91 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-13 13:07:57,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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)