/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 21:48:05,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 21:48:05,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 21:48:05,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 21:48:05,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 21:48:05,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 21:48:05,272 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 21:48:05,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 21:48:05,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 21:48:05,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 21:48:05,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 21:48:05,314 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 21:48:05,314 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 21:48:05,322 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 21:48:05,324 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 21:48:05,326 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 21:48:05,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 21:48:05,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 21:48:05,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 21:48:05,341 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 21:48:05,351 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 21:48:05,353 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 21:48:05,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 21:48:05,356 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 21:48:05,360 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 21:48:05,361 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 21:48:05,361 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 21:48:05,363 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 21:48:05,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 21:48:05,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 21:48:05,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 21:48:05,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 21:48:05,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 21:48:05,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 21:48:05,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 21:48:05,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 21:48:05,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 21:48:05,370 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 21:48:05,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 21:48:05,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 21:48:05,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 21:48:05,374 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-15 21:48:05,409 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 21:48:05,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 21:48:05,410 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 21:48:05,410 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 21:48:05,411 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 21:48:05,412 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 21:48:05,413 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 21:48:05,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 21:48:05,413 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 21:48:05,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 21:48:05,414 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 21:48:05,414 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 21:48:05,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 21:48:05,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 21:48:05,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 21:48:05,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 21:48:05,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 21:48:05,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 21:48:05,416 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 21:48:05,416 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 21:48:05,417 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 21:48:05,417 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 21:48:05,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 21:48:05,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 21:48:05,418 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 21:48:05,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 21:48:05,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:48:05,419 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 21:48:05,419 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 21:48:05,419 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 21:48:05,419 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 21:48:05,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 21:48:05,420 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 21:48:05,420 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-10-15 21:48:05,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 21:48:05,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 21:48:05,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 21:48:05,889 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 21:48:05,890 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 21:48:05,892 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i [2022-10-15 21:48:05,975 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9db3c994a/7f77924ee5984eafb2773f3e4c5444ba/FLAG8fd1a66e3 [2022-10-15 21:48:06,967 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 21:48:06,968 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i [2022-10-15 21:48:06,986 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9db3c994a/7f77924ee5984eafb2773f3e4c5444ba/FLAG8fd1a66e3 [2022-10-15 21:48:07,156 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9db3c994a/7f77924ee5984eafb2773f3e4c5444ba [2022-10-15 21:48:07,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 21:48:07,168 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 21:48:07,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 21:48:07,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 21:48:07,177 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 21:48:07,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:48:07" (1/1) ... [2022-10-15 21:48:07,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2824ea55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:48:07, skipping insertion in model container [2022-10-15 21:48:07,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:48:07" (1/1) ... [2022-10-15 21:48:07,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 21:48:07,235 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 21:48:07,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:48:07,656 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 21:48:07,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:48:07,813 INFO L208 MainTranslator]: Completed translation [2022-10-15 21:48:07,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:48:07 WrapperNode [2022-10-15 21:48:07,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 21:48:07,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 21:48:07,819 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 21:48:07,820 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 21:48:07,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:48:07" (1/1) ... [2022-10-15 21:48:07,894 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:48:07" (1/1) ... [2022-10-15 21:48:07,964 INFO L138 Inliner]: procedures = 126, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 94 [2022-10-15 21:48:07,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 21:48:07,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 21:48:07,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 21:48:07,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 21:48:07,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:48:07" (1/1) ... [2022-10-15 21:48:07,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:48:07" (1/1) ... [2022-10-15 21:48:08,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:48:07" (1/1) ... [2022-10-15 21:48:08,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:48:07" (1/1) ... [2022-10-15 21:48:08,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:48:07" (1/1) ... [2022-10-15 21:48:08,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:48:07" (1/1) ... [2022-10-15 21:48:08,039 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:48:07" (1/1) ... [2022-10-15 21:48:08,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:48:07" (1/1) ... [2022-10-15 21:48:08,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 21:48:08,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 21:48:08,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 21:48:08,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 21:48:08,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:48:07" (1/1) ... [2022-10-15 21:48:08,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:48:08,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:48:08,106 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 21:48:08,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 21:48:08,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 21:48:08,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 21:48:08,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 21:48:08,249 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2022-10-15 21:48:08,249 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2022-10-15 21:48:08,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 21:48:08,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 21:48:08,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 21:48:08,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 21:48:08,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 21:48:08,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-15 21:48:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 21:48:08,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 21:48:08,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 21:48:08,552 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 21:48:08,563 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 21:48:09,185 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 21:48:09,196 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 21:48:09,196 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-10-15 21:48:09,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:48:09 BoogieIcfgContainer [2022-10-15 21:48:09,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 21:48:09,203 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 21:48:09,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 21:48:09,208 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 21:48:09,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:48:07" (1/3) ... [2022-10-15 21:48:09,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382b84a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:48:09, skipping insertion in model container [2022-10-15 21:48:09,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:48:07" (2/3) ... [2022-10-15 21:48:09,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382b84a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:48:09, skipping insertion in model container [2022-10-15 21:48:09,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:48:09" (3/3) ... [2022-10-15 21:48:09,213 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-1.i [2022-10-15 21:48:09,241 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 21:48:09,241 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-10-15 21:48:09,317 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 21:48:09,328 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@781f46d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 21:48:09,328 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-10-15 21:48:09,335 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 47 states have internal predecessors, (64), 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) [2022-10-15 21:48:09,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 21:48:09,348 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:48:09,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:48:09,350 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-15 21:48:09,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:48:09,358 INFO L85 PathProgramCache]: Analyzing trace with hash 599351698, now seen corresponding path program 1 times [2022-10-15 21:48:09,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:48:09,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32403233] [2022-10-15 21:48:09,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:48:09,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:48:09,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:48:09,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:48:09,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:48:09,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32403233] [2022-10-15 21:48:09,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32403233] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:48:09,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:48:09,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:48:09,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764978282] [2022-10-15 21:48:09,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:48:09,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:48:09,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:48:09,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:48:09,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:48:09,975 INFO L87 Difference]: Start difference. First operand has 51 states, 41 states have (on average 1.5609756097560976) internal successors, (64), 47 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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) [2022-10-15 21:48:10,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:48:10,073 INFO L93 Difference]: Finished difference Result 104 states and 144 transitions. [2022-10-15 21:48:10,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:48:10,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 11 [2022-10-15 21:48:10,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:48:10,096 INFO L225 Difference]: With dead ends: 104 [2022-10-15 21:48:10,097 INFO L226 Difference]: Without dead ends: 48 [2022-10-15 21:48:10,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:48:10,113 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 3 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:48:10,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 174 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:48:10,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-10-15 21:48:10,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-10-15 21:48:10,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 44 states have internal predecessors, (55), 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) [2022-10-15 21:48:10,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2022-10-15 21:48:10,242 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 11 [2022-10-15 21:48:10,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:48:10,243 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2022-10-15 21:48:10,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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) [2022-10-15 21:48:10,244 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-10-15 21:48:10,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 21:48:10,253 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:48:10,253 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:48:10,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 21:48:10,259 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-15 21:48:10,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:48:10,264 INFO L85 PathProgramCache]: Analyzing trace with hash -29126898, now seen corresponding path program 1 times [2022-10-15 21:48:10,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:48:10,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437509417] [2022-10-15 21:48:10,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:48:10,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:48:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:48:10,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 21:48:10,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:48:10,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437509417] [2022-10-15 21:48:10,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437509417] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:48:10,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:48:10,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:48:10,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349747627] [2022-10-15 21:48:10,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:48:10,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:48:10,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:48:10,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:48:10,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:48:10,754 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 4 states, 4 states have (on average 3.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) [2022-10-15 21:48:10,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:48:10,894 INFO L93 Difference]: Finished difference Result 128 states and 159 transitions. [2022-10-15 21:48:10,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:48:10,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.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 15 [2022-10-15 21:48:10,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:48:10,904 INFO L225 Difference]: With dead ends: 128 [2022-10-15 21:48:10,905 INFO L226 Difference]: Without dead ends: 82 [2022-10-15 21:48:10,909 INFO L412 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 [2022-10-15 21:48:10,914 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 33 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:48:10,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 153 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:48:10,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-10-15 21:48:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2022-10-15 21:48:10,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 71 states have internal predecessors, (93), 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) [2022-10-15 21:48:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2022-10-15 21:48:10,953 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 15 [2022-10-15 21:48:10,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:48:10,957 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2022-10-15 21:48:10,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.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) [2022-10-15 21:48:10,958 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2022-10-15 21:48:10,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 21:48:10,959 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:48:10,963 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:48:10,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 21:48:10,964 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-15 21:48:10,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:48:10,965 INFO L85 PathProgramCache]: Analyzing trace with hash 650931472, now seen corresponding path program 1 times [2022-10-15 21:48:10,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:48:10,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417271179] [2022-10-15 21:48:10,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:48:10,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:48:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:48:11,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 21:48:11,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:48:11,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417271179] [2022-10-15 21:48:11,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417271179] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:48:11,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:48:11,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:48:11,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226201233] [2022-10-15 21:48:11,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:48:11,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:48:11,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:48:11,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:48:11,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:48:11,083 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2022-10-15 21:48:11,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:48:11,116 INFO L93 Difference]: Finished difference Result 76 states and 97 transitions. [2022-10-15 21:48:11,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:48:11,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 15 [2022-10-15 21:48:11,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:48:11,119 INFO L225 Difference]: With dead ends: 76 [2022-10-15 21:48:11,119 INFO L226 Difference]: Without dead ends: 75 [2022-10-15 21:48:11,120 INFO L412 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 [2022-10-15 21:48:11,122 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 5 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:48:11,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 145 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:48:11,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-10-15 21:48:11,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-10-15 21:48:11,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 66 states have (on average 1.378787878787879) internal successors, (91), 70 states have internal predecessors, (91), 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) [2022-10-15 21:48:11,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2022-10-15 21:48:11,137 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 15 [2022-10-15 21:48:11,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:48:11,137 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2022-10-15 21:48:11,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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) [2022-10-15 21:48:11,138 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2022-10-15 21:48:11,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 21:48:11,140 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:48:11,140 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:48:11,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 21:48:11,141 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-15 21:48:11,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:48:11,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1295960794, now seen corresponding path program 1 times [2022-10-15 21:48:11,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:48:11,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469615223] [2022-10-15 21:48:11,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:48:11,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:48:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:48:11,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:48:11,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:48:11,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469615223] [2022-10-15 21:48:11,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469615223] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:48:11,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751600836] [2022-10-15 21:48:11,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:48:11,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:48:11,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:48:11,362 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) [2022-10-15 21:48:11,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 21:48:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:48:11,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 5 conjunts are in the unsatisfiable core [2022-10-15 21:48:11,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:48:11,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:48:11,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:48:11,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751600836] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:48:11,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:48:11,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-10-15 21:48:11,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912764207] [2022-10-15 21:48:11,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:48:11,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 21:48:11,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:48:11,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 21:48:11,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-15 21:48:11,710 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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) [2022-10-15 21:48:11,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:48:11,799 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2022-10-15 21:48:11,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:48:11,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 16 [2022-10-15 21:48:11,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:48:11,811 INFO L225 Difference]: With dead ends: 77 [2022-10-15 21:48:11,811 INFO L226 Difference]: Without dead ends: 76 [2022-10-15 21:48:11,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:48:11,826 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 28 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:48:11,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 202 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:48:11,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-10-15 21:48:11,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2022-10-15 21:48:11,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 63 states have internal predecessors, (83), 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) [2022-10-15 21:48:11,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2022-10-15 21:48:11,860 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 16 [2022-10-15 21:48:11,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:48:11,860 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2022-10-15 21:48:11,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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) [2022-10-15 21:48:11,863 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2022-10-15 21:48:11,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 21:48:11,865 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:48:11,865 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:48:11,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-10-15 21:48:12,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:48:12,080 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-15 21:48:12,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:48:12,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1110772086, now seen corresponding path program 1 times [2022-10-15 21:48:12,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:48:12,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6835014] [2022-10-15 21:48:12,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:48:12,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:48:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:48:12,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:48:12,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:48:12,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6835014] [2022-10-15 21:48:12,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6835014] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:48:12,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042872202] [2022-10-15 21:48:12,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:48:12,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:48:12,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:48:12,226 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) [2022-10-15 21:48:12,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 21:48:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:48:12,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 21:48:12,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:48:12,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:48:12,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:48:12,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:48:12,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042872202] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:48:12,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:48:12,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-10-15 21:48:12,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316747869] [2022-10-15 21:48:12,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:48:12,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 21:48:12,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:48:12,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 21:48:12,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:48:12,447 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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) [2022-10-15 21:48:12,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:48:12,521 INFO L93 Difference]: Finished difference Result 150 states and 194 transitions. [2022-10-15 21:48:12,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:48:12,522 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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 20 [2022-10-15 21:48:12,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:48:12,525 INFO L225 Difference]: With dead ends: 150 [2022-10-15 21:48:12,525 INFO L226 Difference]: Without dead ends: 84 [2022-10-15 21:48:12,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-10-15 21:48:12,536 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 13 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:48:12,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 242 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:48:12,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-10-15 21:48:12,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-10-15 21:48:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 79 states have internal predecessors, (99), 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) [2022-10-15 21:48:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions. [2022-10-15 21:48:12,572 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 103 transitions. Word has length 20 [2022-10-15 21:48:12,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:48:12,574 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 103 transitions. [2022-10-15 21:48:12,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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) [2022-10-15 21:48:12,575 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions. [2022-10-15 21:48:12,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-15 21:48:12,578 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:48:12,578 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:48:12,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 21:48:12,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:48:12,795 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-15 21:48:12,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:48:12,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1572551298, now seen corresponding path program 2 times [2022-10-15 21:48:12,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:48:12,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618140907] [2022-10-15 21:48:12,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:48:12,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:48:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:48:13,275 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 21:48:13,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:48:13,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618140907] [2022-10-15 21:48:13,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618140907] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:48:13,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:48:13,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:48:13,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478251700] [2022-10-15 21:48:13,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:48:13,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:48:13,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:48:13,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:48:13,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:48:13,281 INFO L87 Difference]: Start difference. First operand 84 states and 103 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:48:13,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:48:13,467 INFO L93 Difference]: Finished difference Result 112 states and 141 transitions. [2022-10-15 21:48:13,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:48:13,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-10-15 21:48:13,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:48:13,470 INFO L225 Difference]: With dead ends: 112 [2022-10-15 21:48:13,470 INFO L226 Difference]: Without dead ends: 111 [2022-10-15 21:48:13,471 INFO L412 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 [2022-10-15 21:48:13,472 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 17 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:48:13,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 161 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 21:48:13,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-10-15 21:48:13,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 96. [2022-10-15 21:48:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 91 states have internal predecessors, (117), 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) [2022-10-15 21:48:13,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 121 transitions. [2022-10-15 21:48:13,488 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 121 transitions. Word has length 28 [2022-10-15 21:48:13,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:48:13,488 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 121 transitions. [2022-10-15 21:48:13,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:48:13,489 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2022-10-15 21:48:13,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-15 21:48:13,490 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:48:13,491 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:48:13,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 21:48:13,491 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-15 21:48:13,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:48:13,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1504449897, now seen corresponding path program 1 times [2022-10-15 21:48:13,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:48:13,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778427421] [2022-10-15 21:48:13,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:48:13,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:48:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:48:13,788 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 21:48:13,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:48:13,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778427421] [2022-10-15 21:48:13,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778427421] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:48:13,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:48:13,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:48:13,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746471385] [2022-10-15 21:48:13,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:48:13,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:48:13,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:48:13,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:48:13,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:48:13,792 INFO L87 Difference]: Start difference. First operand 96 states and 121 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) [2022-10-15 21:48:13,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:48:13,928 INFO L93 Difference]: Finished difference Result 111 states and 139 transitions. [2022-10-15 21:48:13,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:48:13,929 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 29 [2022-10-15 21:48:13,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:48:13,930 INFO L225 Difference]: With dead ends: 111 [2022-10-15 21:48:13,931 INFO L226 Difference]: Without dead ends: 110 [2022-10-15 21:48:13,931 INFO L412 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 [2022-10-15 21:48:13,933 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 22 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:48:13,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 129 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:48:13,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-10-15 21:48:13,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2022-10-15 21:48:13,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 93 states have internal predecessors, (119), 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) [2022-10-15 21:48:13,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 123 transitions. [2022-10-15 21:48:13,961 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 123 transitions. Word has length 29 [2022-10-15 21:48:13,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:48:13,961 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 123 transitions. [2022-10-15 21:48:13,962 INFO L496 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) [2022-10-15 21:48:13,962 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 123 transitions. [2022-10-15 21:48:13,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-15 21:48:13,966 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:48:13,967 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:48:13,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 21:48:13,967 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-15 21:48:13,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:48:13,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1625971258, now seen corresponding path program 1 times [2022-10-15 21:48:13,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:48:13,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567701300] [2022-10-15 21:48:13,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:48:13,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:48:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:48:14,634 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 21:48:14,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:48:14,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567701300] [2022-10-15 21:48:14,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567701300] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:48:14,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:48:14,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:48:14,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152721245] [2022-10-15 21:48:14,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:48:14,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 21:48:14,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:48:14,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 21:48:14,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:48:14,638 INFO L87 Difference]: Start difference. First operand 98 states and 123 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-10-15 21:48:15,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:48:15,008 INFO L93 Difference]: Finished difference Result 132 states and 165 transitions. [2022-10-15 21:48:15,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:48:15,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 [2022-10-15 21:48:15,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:48:15,011 INFO L225 Difference]: With dead ends: 132 [2022-10-15 21:48:15,011 INFO L226 Difference]: Without dead ends: 130 [2022-10-15 21:48:15,011 INFO L412 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 [2022-10-15 21:48:15,012 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 37 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 21:48:15,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 164 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 21:48:15,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-10-15 21:48:15,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 108. [2022-10-15 21:48:15,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 100 states have (on average 1.31) internal successors, (131), 103 states have internal predecessors, (131), 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) [2022-10-15 21:48:15,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 135 transitions. [2022-10-15 21:48:15,022 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 135 transitions. Word has length 31 [2022-10-15 21:48:15,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:48:15,023 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 135 transitions. [2022-10-15 21:48:15,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-10-15 21:48:15,024 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 135 transitions. [2022-10-15 21:48:15,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-15 21:48:15,025 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:48:15,025 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:48:15,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 21:48:15,026 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-15 21:48:15,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:48:15,026 INFO L85 PathProgramCache]: Analyzing trace with hash -745608013, now seen corresponding path program 1 times [2022-10-15 21:48:15,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:48:15,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026569458] [2022-10-15 21:48:15,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:48:15,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:48:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:48:16,638 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 21:48:16,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:48:16,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026569458] [2022-10-15 21:48:16,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026569458] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:48:16,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454949283] [2022-10-15 21:48:16,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:48:16,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:48:16,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:48:16,642 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) [2022-10-15 21:48:16,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-15 21:48:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:48:16,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 31 conjunts are in the unsatisfiable core [2022-10-15 21:48:16,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:48:16,923 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-15 21:48:16,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-10-15 21:48:17,008 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-15 21:48:17,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-10-15 21:48:17,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-10-15 21:48:17,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 21:48:17,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 22 [2022-10-15 21:48:17,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 25 [2022-10-15 21:48:17,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 21:48:17,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-10-15 21:48:17,277 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 21:48:17,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:48:17,326 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_create_data_~nextData~0.base_3 Int) (v_ArrVal_613 (Array Int Int))) (or (< (select (select (store |c_#memory_int| v_create_data_~nextData~0.base_3 v_ArrVal_613) c_create_data_~data~0.base) c_create_data_~data~0.offset) 2147483848) (not (= (select |c_#valid| v_create_data_~nextData~0.base_3) 0)))) is different from false [2022-10-15 21:48:17,423 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 21:48:17,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 47 treesize of output 40 [2022-10-15 21:48:17,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 54 [2022-10-15 21:48:17,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 44 [2022-10-15 21:48:17,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 20 [2022-10-15 21:48:17,826 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 2 not checked. [2022-10-15 21:48:17,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454949283] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:48:17,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:48:17,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-10-15 21:48:17,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950244552] [2022-10-15 21:48:17,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:48:17,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-15 21:48:17,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:48:17,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-15 21:48:17,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=192, Unknown=1, NotChecked=28, Total=272 [2022-10-15 21:48:17,830 INFO L87 Difference]: Start difference. First operand 108 states and 135 transitions. Second operand has 17 states, 16 states have (on average 4.125) internal successors, (66), 17 states have internal predecessors, (66), 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) [2022-10-15 21:48:18,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:48:18,797 INFO L93 Difference]: Finished difference Result 145 states and 183 transitions. [2022-10-15 21:48:18,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 21:48:18,798 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.125) internal successors, (66), 17 states have internal predecessors, (66), 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 35 [2022-10-15 21:48:18,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:48:18,801 INFO L225 Difference]: With dead ends: 145 [2022-10-15 21:48:18,801 INFO L226 Difference]: Without dead ends: 144 [2022-10-15 21:48:18,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=383, Unknown=5, NotChecked=42, Total=552 [2022-10-15 21:48:18,803 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 83 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 21:48:18,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 462 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 119 Invalid, 0 Unknown, 160 Unchecked, 0.6s Time] [2022-10-15 21:48:18,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-10-15 21:48:18,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 114. [2022-10-15 21:48:18,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 109 states have internal predecessors, (139), 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) [2022-10-15 21:48:18,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 143 transitions. [2022-10-15 21:48:18,823 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 143 transitions. Word has length 35 [2022-10-15 21:48:18,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:48:18,824 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 143 transitions. [2022-10-15 21:48:18,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.125) internal successors, (66), 17 states have internal predecessors, (66), 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) [2022-10-15 21:48:18,825 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 143 transitions. [2022-10-15 21:48:18,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-15 21:48:18,827 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:48:18,827 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:48:18,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-15 21:48:19,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:48:19,045 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-15 21:48:19,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:48:19,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1900915167, now seen corresponding path program 1 times [2022-10-15 21:48:19,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:48:19,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248017335] [2022-10-15 21:48:19,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:48:19,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:48:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 21:48:19,119 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 21:48:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 21:48:19,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 21:48:19,197 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 21:48:19,198 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location create_dataErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-10-15 21:48:19,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-10-15 21:48:19,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-10-15 21:48:19,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-10-15 21:48:19,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-10-15 21:48:19,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location create_dataErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-10-15 21:48:19,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 21:48:19,209 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:48:19,216 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 21:48:19,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 09:48:19 BoogieIcfgContainer [2022-10-15 21:48:19,270 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 21:48:19,271 INFO L158 Benchmark]: Toolchain (without parser) took 12107.78ms. Allocated memory was 161.5MB in the beginning and 288.4MB in the end (delta: 126.9MB). Free memory was 135.5MB in the beginning and 229.1MB in the end (delta: -93.6MB). Peak memory consumption was 33.9MB. Max. memory is 8.0GB. [2022-10-15 21:48:19,271 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 161.5MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 21:48:19,272 INFO L158 Benchmark]: CACSL2BoogieTranslator took 646.04ms. Allocated memory is still 161.5MB. Free memory was 135.3MB in the beginning and 117.8MB in the end (delta: 17.6MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-10-15 21:48:19,272 INFO L158 Benchmark]: Boogie Procedure Inliner took 146.73ms. Allocated memory is still 161.5MB. Free memory was 117.8MB in the beginning and 115.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 21:48:19,273 INFO L158 Benchmark]: Boogie Preprocessor took 81.53ms. Allocated memory is still 161.5MB. Free memory was 115.8MB in the beginning and 113.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 21:48:19,273 INFO L158 Benchmark]: RCFGBuilder took 1150.58ms. Allocated memory is still 161.5MB. Free memory was 113.7MB in the beginning and 124.1MB in the end (delta: -10.3MB). Peak memory consumption was 5.7MB. Max. memory is 8.0GB. [2022-10-15 21:48:19,274 INFO L158 Benchmark]: TraceAbstraction took 10067.11ms. Allocated memory was 161.5MB in the beginning and 288.4MB in the end (delta: 126.9MB). Free memory was 123.5MB in the beginning and 229.1MB in the end (delta: -105.6MB). Peak memory consumption was 21.8MB. Max. memory is 8.0GB. [2022-10-15 21:48:19,276 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 161.5MB. Free memory is still 131.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 646.04ms. Allocated memory is still 161.5MB. Free memory was 135.3MB in the beginning and 117.8MB in the end (delta: 17.6MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 146.73ms. Allocated memory is still 161.5MB. Free memory was 117.8MB in the beginning and 115.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 81.53ms. Allocated memory is still 161.5MB. Free memory was 115.8MB in the beginning and 113.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1150.58ms. Allocated memory is still 161.5MB. Free memory was 113.7MB in the beginning and 124.1MB in the end (delta: -10.3MB). Peak memory consumption was 5.7MB. Max. memory is 8.0GB. * TraceAbstraction took 10067.11ms. Allocated memory was 161.5MB in the beginning and 288.4MB in the end (delta: 126.9MB). Free memory was 123.5MB in the beginning and 229.1MB in the end (delta: -105.6MB). Peak memory consumption was 21.8MB. Max. memory is 8.0GB. * 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); [L599] int dataNotFinished = 0; VAL [dataNotFinished=0, 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) VAL [\read(**pointerToList)={0:0}, node={-1:0}, pointerToList={3:0}, pointerToList={3:0}] [L590] COND TRUE *pointerToList == ((void *)0) [L591] CALL create_data(((void *)0)) VAL [prevData={0:0}] [L552] prevData != ((void *)0) && prevData->hasNextPartReference VAL [prevData={0:0}, prevData={0:0}, prevData != ((void *)0) && prevData->hasNextPartReference=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 [counter=0, data={-3:0}, prevData={0:0}, prevData={0:0}] [L558] COND TRUE counter < 3 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [counter=1, data={-3:0}, prevData={0:0}, prevData={0:0}] [L558] COND TRUE counter < 3 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [counter=2, data={-3:0}, prevData={0:0}, prevData={0:0}] [L558] COND TRUE counter < 3 [L559] EXPR data->array [L559] data->array[counter] = __VERIFIER_nondet_int() [L558] counter++ VAL [counter=3, data={-3:0}, prevData={0:0}, prevData={0:0}] [L558] COND FALSE !(counter < 3) VAL [counter=3, data={-3:0}, prevData={0:0}, prevData={0:0}] [L561] data->number = 0 [L562] int userInput = __VERIFIER_nondet_int(); [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 [L563] EXPR data->number [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [__VERIFIER_nondet_int()=6, __VERIFIER_nondet_int() && data->number < 200=1, counter=3, data={-3:0}, data->number=0, prevData={0: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 [__VERIFIER_nondet_int()=6, __VERIFIER_nondet_int() && data->number < 200=1, __VERIFIER_nondet_int() && data->number < 200 && data->number > -200=1, counter=3, data={-3:0}, data->number=0, data->number=0, prevData={0: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 [L563] EXPR data->number [L563] EXPR __VERIFIER_nondet_int() && data->number < 200 VAL [__VERIFIER_nondet_int()=-6, __VERIFIER_nondet_int() && data->number < 200=1, counter=3, data={-3:0}, data->number=7, prevData={0: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 [__VERIFIER_nondet_int()=-6, __VERIFIER_nondet_int() && data->number < 200=1, __VERIFIER_nondet_int() && data->number < 200 && data->number > -200=1, counter=3, data={-3:0}, data->number=7, data->number=7, prevData={0: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 [__VERIFIER_nondet_int()=2147483641, counter=3, data={-3:0}, data->number=7, prevData={0:0}, prevData={0:0}, userInput=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, 51 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 241 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 241 mSDsluCounter, 1832 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 160 IncrementalHoareTripleChecker+Unchecked, 1381 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 335 IncrementalHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 451 mSDtfsCounter, 335 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 119 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 93 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 306 NumberOfCodeBlocks, 306 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 312 ConstructedInterpolants, 28 QuantifiedInterpolants, 1459 SizeOfPredicates, 12 NumberOfNonLiveVariables, 762 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 102/116 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! [2022-10-15 21:48:19,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...