./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-75.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-75.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aae2fa1a6f385f97337cc2b739ec0b65ccf727ece5077a08bd3db09419c3a3cc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:52:00,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:52:00,816 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:52:00,822 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:52:00,823 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:52:00,844 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:52:00,845 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:52:00,845 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:52:00,846 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:52:00,846 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:52:00,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:52:00,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:52:00,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:52:00,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:52:00,849 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:52:00,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:52:00,849 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:52:00,850 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:52:00,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:52:00,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:52:00,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:52:00,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:52:00,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:52:00,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:52:00,853 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:52:00,854 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:52:00,854 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:52:00,854 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:52:00,854 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:52:00,855 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:52:00,855 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:52:00,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:52:00,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:52:00,856 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:52:00,856 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:52:00,856 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:52:00,856 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:52:00,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:52:00,857 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:52:00,857 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:52:00,857 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:52:00,858 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:52:00,858 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aae2fa1a6f385f97337cc2b739ec0b65ccf727ece5077a08bd3db09419c3a3cc [2024-10-24 11:52:01,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:52:01,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:52:01,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:52:01,146 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:52:01,147 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:52:01,148 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-75.i [2024-10-24 11:52:02,688 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:52:02,903 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:52:02,904 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-75.i [2024-10-24 11:52:02,916 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42d6dffe4/0e7e62729ee944b580e48a8c4b93d42b/FLAG00eea5f24 [2024-10-24 11:52:02,934 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42d6dffe4/0e7e62729ee944b580e48a8c4b93d42b [2024-10-24 11:52:02,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:52:02,939 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:52:02,940 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:52:02,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:52:02,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:52:02,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:52:02" (1/1) ... [2024-10-24 11:52:02,949 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55d3a1cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:02, skipping insertion in model container [2024-10-24 11:52:02,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:52:02" (1/1) ... [2024-10-24 11:52:02,983 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:52:03,175 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-75.i[916,929] [2024-10-24 11:52:03,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:52:03,267 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:52:03,280 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-75.i[916,929] [2024-10-24 11:52:03,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:52:03,356 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:52:03,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03 WrapperNode [2024-10-24 11:52:03,357 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:52:03,358 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:52:03,358 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:52:03,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:52:03,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:03,385 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:03,442 INFO L138 Inliner]: procedures = 29, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 459 [2024-10-24 11:52:03,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:52:03,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:52:03,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:52:03,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:52:03,454 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:03,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:03,464 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:03,487 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 18 writes are split as follows [0, 18]. [2024-10-24 11:52:03,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:03,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:03,511 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:03,519 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:03,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:03,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:03,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:52:03,530 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:52:03,530 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:52:03,531 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:52:03,533 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (1/1) ... [2024-10-24 11:52:03,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:52:03,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:52:03,585 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:52:03,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:52:03,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:52:03,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:52:03,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:52:03,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:52:03,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:52:03,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:52:03,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:52:03,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:52:03,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:52:03,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:52:03,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:52:03,635 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:52:03,635 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:52:03,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:52:03,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:52:03,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:52:03,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:52:03,751 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:52:03,753 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:52:04,249 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-10-24 11:52:04,250 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:52:04,288 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:52:04,290 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:52:04,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:52:04 BoogieIcfgContainer [2024-10-24 11:52:04,290 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:52:04,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:52:04,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:52:04,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:52:04,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:52:02" (1/3) ... [2024-10-24 11:52:04,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19dd7c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:52:04, skipping insertion in model container [2024-10-24 11:52:04,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:03" (2/3) ... [2024-10-24 11:52:04,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19dd7c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:52:04, skipping insertion in model container [2024-10-24 11:52:04,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:52:04" (3/3) ... [2024-10-24 11:52:04,300 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-75.i [2024-10-24 11:52:04,335 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:52:04,336 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:52:04,425 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:52:04,431 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5aef2494, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:52:04,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:52:04,436 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 71 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:52:04,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:52:04,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:04,448 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:04,449 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:04,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:04,455 INFO L85 PathProgramCache]: Analyzing trace with hash -950670421, now seen corresponding path program 1 times [2024-10-24 11:52:04,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:04,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869142104] [2024-10-24 11:52:04,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:04,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:04,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:04,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:04,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:52:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:04,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:52:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:04,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:52:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:04,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:52:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:04,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:52:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:04,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:52:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:04,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:52:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:04,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:52:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:04,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:52:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:04,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:52:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:04,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:52:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:04,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:52:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:04,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:52:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:04,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:52:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:04,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:52:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:52:04,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:04,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869142104] [2024-10-24 11:52:04,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869142104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:04,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:04,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:52:04,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813253206] [2024-10-24 11:52:04,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:04,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:52:04,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:04,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:52:04,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:52:04,968 INFO L87 Difference]: Start difference. First operand has 90 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 71 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:52:05,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:05,018 INFO L93 Difference]: Finished difference Result 177 states and 285 transitions. [2024-10-24 11:52:05,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:52:05,021 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2024-10-24 11:52:05,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:05,029 INFO L225 Difference]: With dead ends: 177 [2024-10-24 11:52:05,029 INFO L226 Difference]: Without dead ends: 88 [2024-10-24 11:52:05,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:52:05,036 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:05,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:52:05,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-24 11:52:05,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-24 11:52:05,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.391304347826087) internal successors, (96), 69 states have internal predecessors, (96), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:52:05,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2024-10-24 11:52:05,078 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 131 [2024-10-24 11:52:05,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:05,079 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 130 transitions. [2024-10-24 11:52:05,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:52:05,079 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 130 transitions. [2024-10-24 11:52:05,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:52:05,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:05,085 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:05,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:52:05,086 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:05,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:05,086 INFO L85 PathProgramCache]: Analyzing trace with hash 685314461, now seen corresponding path program 1 times [2024-10-24 11:52:05,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:05,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779931461] [2024-10-24 11:52:05,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:05,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:52:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:52:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:52:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:52:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:52:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:52:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:52:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:52:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:52:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:52:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:52:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:52:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:52:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:52:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:52:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,428 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:52:05,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:05,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779931461] [2024-10-24 11:52:05,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779931461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:05,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:05,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:52:05,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115718309] [2024-10-24 11:52:05,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:05,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:52:05,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:05,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:52:05,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:52:05,433 INFO L87 Difference]: Start difference. First operand 88 states and 130 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:52:05,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:05,498 INFO L93 Difference]: Finished difference Result 177 states and 262 transitions. [2024-10-24 11:52:05,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:52:05,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2024-10-24 11:52:05,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:05,500 INFO L225 Difference]: With dead ends: 177 [2024-10-24 11:52:05,502 INFO L226 Difference]: Without dead ends: 90 [2024-10-24 11:52:05,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:52:05,504 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:05,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 365 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:52:05,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-24 11:52:05,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-24 11:52:05,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.380281690140845) internal successors, (98), 71 states have internal predecessors, (98), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:52:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2024-10-24 11:52:05,527 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 131 [2024-10-24 11:52:05,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:05,528 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2024-10-24 11:52:05,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:52:05,529 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2024-10-24 11:52:05,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:52:05,532 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:05,532 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:05,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:52:05,533 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:05,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:05,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1887650149, now seen corresponding path program 1 times [2024-10-24 11:52:05,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:05,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280518499] [2024-10-24 11:52:05,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:05,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:52:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:52:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:52:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:52:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:52:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:52:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:52:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:52:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:52:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:52:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:52:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:52:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:52:05,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:52:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:52:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:05,835 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:52:05,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:05,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280518499] [2024-10-24 11:52:05,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280518499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:05,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:05,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:52:05,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239707293] [2024-10-24 11:52:05,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:05,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:52:05,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:05,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:52:05,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:52:05,841 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:52:05,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:05,900 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2024-10-24 11:52:05,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:52:05,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-24 11:52:05,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:05,905 INFO L225 Difference]: With dead ends: 182 [2024-10-24 11:52:05,905 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 11:52:05,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:52:05,909 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:05,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 362 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:52:05,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 11:52:05,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-10-24 11:52:05,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:52:05,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-10-24 11:52:05,927 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 131 [2024-10-24 11:52:05,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:05,928 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-10-24 11:52:05,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:52:05,928 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-10-24 11:52:05,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:52:05,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:05,932 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:05,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:52:05,934 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:05,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:05,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1830391847, now seen corresponding path program 1 times [2024-10-24 11:52:05,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:05,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574112137] [2024-10-24 11:52:05,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:05,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:06,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:06,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:06,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:52:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:06,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:52:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:06,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:52:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:06,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:52:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:06,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:52:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:06,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:52:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:06,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:52:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:06,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:52:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:06,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:52:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:06,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:52:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:06,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:52:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:06,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:52:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:06,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:52:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:06,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:52:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:06,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:52:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:06,127 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:52:06,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:06,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574112137] [2024-10-24 11:52:06,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574112137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:06,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:06,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:52:06,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195795956] [2024-10-24 11:52:06,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:06,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:52:06,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:06,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:52:06,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:52:06,130 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:52:06,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:06,171 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2024-10-24 11:52:06,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:52:06,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-24 11:52:06,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:06,173 INFO L225 Difference]: With dead ends: 186 [2024-10-24 11:52:06,173 INFO L226 Difference]: Without dead ends: 95 [2024-10-24 11:52:06,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:52:06,175 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:06,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 366 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:52:06,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-24 11:52:06,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-10-24 11:52:06,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:52:06,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-10-24 11:52:06,183 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 131 [2024-10-24 11:52:06,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:06,183 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-10-24 11:52:06,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:52:06,184 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-10-24 11:52:06,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:52:06,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:06,186 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:06,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:52:06,187 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:06,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:06,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1830332265, now seen corresponding path program 1 times [2024-10-24 11:52:06,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:06,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623422373] [2024-10-24 11:52:06,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:06,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:07,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:07,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:07,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:52:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:07,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:52:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:07,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:52:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:07,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:52:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:07,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:52:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:07,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:52:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:07,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:52:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:07,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:52:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:07,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:52:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:08,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:52:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:08,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:52:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:08,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:52:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:08,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:52:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:08,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:52:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:08,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:52:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:08,024 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:52:08,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:08,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623422373] [2024-10-24 11:52:08,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623422373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:08,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:08,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:52:08,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150417167] [2024-10-24 11:52:08,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:08,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:52:08,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:08,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:52:08,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:52:08,032 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:52:08,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:08,243 INFO L93 Difference]: Finished difference Result 187 states and 271 transitions. [2024-10-24 11:52:08,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:52:08,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2024-10-24 11:52:08,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:08,245 INFO L225 Difference]: With dead ends: 187 [2024-10-24 11:52:08,245 INFO L226 Difference]: Without dead ends: 94 [2024-10-24 11:52:08,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 11:52:08,247 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 42 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:08,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 395 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:52:08,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-24 11:52:08,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-24 11:52:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:52:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 135 transitions. [2024-10-24 11:52:08,258 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 135 transitions. Word has length 131 [2024-10-24 11:52:08,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:08,258 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 135 transitions. [2024-10-24 11:52:08,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:52:08,259 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 135 transitions. [2024-10-24 11:52:08,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:52:08,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:08,266 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:08,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:52:08,267 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:08,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:08,267 INFO L85 PathProgramCache]: Analyzing trace with hash -576179684, now seen corresponding path program 1 times [2024-10-24 11:52:08,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:08,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140635343] [2024-10-24 11:52:08,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:08,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:10,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:10,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:10,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:52:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:10,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:52:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:10,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:52:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:10,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:52:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:10,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:52:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:10,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:52:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:10,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:52:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:10,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:52:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:10,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:52:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:10,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:52:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:10,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:52:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:10,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:52:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:10,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:52:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:10,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:52:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:10,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:52:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:10,977 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:52:10,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:10,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140635343] [2024-10-24 11:52:10,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140635343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:10,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:10,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-24 11:52:10,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475638822] [2024-10-24 11:52:10,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:10,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 11:52:10,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:10,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 11:52:10,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:52:10,980 INFO L87 Difference]: Start difference. First operand 94 states and 135 transitions. Second operand has 16 states, 14 states have (on average 3.642857142857143) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-24 11:52:13,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:13,250 INFO L93 Difference]: Finished difference Result 499 states and 711 transitions. [2024-10-24 11:52:13,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 11:52:13,251 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.642857142857143) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 4 states have call successors, (17) Word has length 133 [2024-10-24 11:52:13,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:13,255 INFO L225 Difference]: With dead ends: 499 [2024-10-24 11:52:13,255 INFO L226 Difference]: Without dead ends: 406 [2024-10-24 11:52:13,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=217, Invalid=775, Unknown=0, NotChecked=0, Total=992 [2024-10-24 11:52:13,258 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 1023 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:13,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 1104 Invalid, 1835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 11:52:13,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-24 11:52:13,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 292. [2024-10-24 11:52:13,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 236 states have (on average 1.3516949152542372) internal successors, (319), 237 states have internal predecessors, (319), 51 states have call successors, (51), 4 states have call predecessors, (51), 4 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-24 11:52:13,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 421 transitions. [2024-10-24 11:52:13,296 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 421 transitions. Word has length 133 [2024-10-24 11:52:13,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:13,297 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 421 transitions. [2024-10-24 11:52:13,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.642857142857143) internal successors, (51), 16 states have internal predecessors, (51), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-24 11:52:13,297 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 421 transitions. [2024-10-24 11:52:13,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:52:13,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:13,299 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:13,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:52:13,299 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:13,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:13,300 INFO L85 PathProgramCache]: Analyzing trace with hash -153477858, now seen corresponding path program 1 times [2024-10-24 11:52:13,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:13,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074686809] [2024-10-24 11:52:13,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:13,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:13,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:13,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:13,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:52:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:13,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:52:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:13,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:52:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:13,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:52:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:13,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:52:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:13,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:52:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:13,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:52:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:13,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:52:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:13,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:52:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:13,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:52:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:13,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:52:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:13,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:52:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:13,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:52:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:13,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:52:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:13,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:52:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:13,872 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:52:13,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:13,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074686809] [2024-10-24 11:52:13,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074686809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:13,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:13,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:52:13,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324366310] [2024-10-24 11:52:13,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:13,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:52:13,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:13,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:52:13,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:52:13,874 INFO L87 Difference]: Start difference. First operand 292 states and 421 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:52:14,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:14,278 INFO L93 Difference]: Finished difference Result 838 states and 1204 transitions. [2024-10-24 11:52:14,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:52:14,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2024-10-24 11:52:14,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:14,285 INFO L225 Difference]: With dead ends: 838 [2024-10-24 11:52:14,287 INFO L226 Difference]: Without dead ends: 547 [2024-10-24 11:52:14,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:52:14,290 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 106 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:14,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 517 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:52:14,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-10-24 11:52:14,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 312. [2024-10-24 11:52:14,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 256 states have (on average 1.36328125) internal successors, (349), 257 states have internal predecessors, (349), 51 states have call successors, (51), 4 states have call predecessors, (51), 4 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-24 11:52:14,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 451 transitions. [2024-10-24 11:52:14,347 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 451 transitions. Word has length 133 [2024-10-24 11:52:14,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:14,348 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 451 transitions. [2024-10-24 11:52:14,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:52:14,349 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 451 transitions. [2024-10-24 11:52:14,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 11:52:14,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:14,352 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:14,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 11:52:14,352 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:14,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:14,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1433341536, now seen corresponding path program 1 times [2024-10-24 11:52:14,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:14,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705843893] [2024-10-24 11:52:14,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:14,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:52:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:52:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:52:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:52:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:52:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:52:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:52:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:52:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:52:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:52:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:52:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:52:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:52:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:52:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:52:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,162 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:52:16,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:16,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705843893] [2024-10-24 11:52:16,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705843893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:16,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:16,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:52:16,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601778829] [2024-10-24 11:52:16,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:16,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:52:16,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:16,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:52:16,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:52:16,167 INFO L87 Difference]: Start difference. First operand 312 states and 451 transitions. Second operand has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:52:16,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:16,589 INFO L93 Difference]: Finished difference Result 668 states and 963 transitions. [2024-10-24 11:52:16,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:52:16,590 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 133 [2024-10-24 11:52:16,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:16,593 INFO L225 Difference]: With dead ends: 668 [2024-10-24 11:52:16,593 INFO L226 Difference]: Without dead ends: 357 [2024-10-24 11:52:16,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:52:16,596 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 88 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:16,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 562 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:52:16,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-24 11:52:16,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 222. [2024-10-24 11:52:16,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 184 states have (on average 1.3695652173913044) internal successors, (252), 185 states have internal predecessors, (252), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 11:52:16,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 320 transitions. [2024-10-24 11:52:16,618 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 320 transitions. Word has length 133 [2024-10-24 11:52:16,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:16,619 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 320 transitions. [2024-10-24 11:52:16,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.666666666666667) internal successors, (51), 10 states have internal predecessors, (51), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:52:16,619 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 320 transitions. [2024-10-24 11:52:16,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 11:52:16,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:16,620 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:16,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 11:52:16,621 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:16,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:16,621 INFO L85 PathProgramCache]: Analyzing trace with hash 921958169, now seen corresponding path program 1 times [2024-10-24 11:52:16,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:16,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669733535] [2024-10-24 11:52:16,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:16,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:52:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 11:52:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:52:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:52:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 11:52:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:52:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 11:52:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:17,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:52:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:17,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 11:52:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:17,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 11:52:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:17,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 11:52:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:17,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 11:52:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:17,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 11:52:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:17,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 11:52:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:17,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 11:52:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:17,013 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:52:17,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:17,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669733535] [2024-10-24 11:52:17,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669733535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:17,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:17,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:52:17,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245160723] [2024-10-24 11:52:17,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:17,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:52:17,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:17,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:52:17,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:52:17,015 INFO L87 Difference]: Start difference. First operand 222 states and 320 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:52:17,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:17,512 INFO L93 Difference]: Finished difference Result 493 states and 705 transitions. [2024-10-24 11:52:17,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:52:17,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2024-10-24 11:52:17,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:17,515 INFO L225 Difference]: With dead ends: 493 [2024-10-24 11:52:17,515 INFO L226 Difference]: Without dead ends: 272 [2024-10-24 11:52:17,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:52:17,516 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 237 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:17,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 283 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:52:17,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-24 11:52:17,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 213. [2024-10-24 11:52:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 175 states have (on average 1.3485714285714285) internal successors, (236), 176 states have internal predecessors, (236), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 11:52:17,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 304 transitions. [2024-10-24 11:52:17,535 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 304 transitions. Word has length 134 [2024-10-24 11:52:17,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:17,536 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 304 transitions. [2024-10-24 11:52:17,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:52:17,536 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 304 transitions. [2024-10-24 11:52:17,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 11:52:17,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:17,537 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:17,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 11:52:17,537 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:17,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:17,538 INFO L85 PathProgramCache]: Analyzing trace with hash 64796317, now seen corresponding path program 1 times [2024-10-24 11:52:17,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:17,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600592689] [2024-10-24 11:52:17,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:17,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:52:17,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1545418840] [2024-10-24 11:52:17,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:17,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:52:17,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:52:17,629 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:52:17,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:52:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:17,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-24 11:52:17,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:52:17,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 11:52:17,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2024-10-24 11:52:18,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:52:18,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 29 treesize of output 31 [2024-10-24 11:52:18,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:52:18,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 37 [2024-10-24 11:52:18,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:52:18,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 55 [2024-10-24 11:52:18,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:52:18,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 16 [2024-10-24 11:52:18,258 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:52:18,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:52:18,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:18,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600592689] [2024-10-24 11:52:18,259 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 11:52:18,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545418840] [2024-10-24 11:52:18,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545418840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:18,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:18,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 11:52:18,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751321322] [2024-10-24 11:52:18,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:18,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 11:52:18,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:18,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 11:52:18,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-24 11:52:18,263 INFO L87 Difference]: Start difference. First operand 213 states and 304 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:52:19,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:19,279 INFO L93 Difference]: Finished difference Result 629 states and 887 transitions. [2024-10-24 11:52:19,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 11:52:19,280 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-24 11:52:19,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:19,282 INFO L225 Difference]: With dead ends: 629 [2024-10-24 11:52:19,282 INFO L226 Difference]: Without dead ends: 417 [2024-10-24 11:52:19,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-24 11:52:19,284 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 504 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:19,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 578 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 11:52:19,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-10-24 11:52:19,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 195. [2024-10-24 11:52:19,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 162 states have (on average 1.3395061728395061) internal successors, (217), 163 states have internal predecessors, (217), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 11:52:19,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 275 transitions. [2024-10-24 11:52:19,313 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 275 transitions. Word has length 134 [2024-10-24 11:52:19,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:19,314 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 275 transitions. [2024-10-24 11:52:19,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:52:19,314 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 275 transitions. [2024-10-24 11:52:19,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 11:52:19,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:19,315 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:19,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 11:52:19,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-24 11:52:19,516 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:19,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:19,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1075913567, now seen corresponding path program 1 times [2024-10-24 11:52:19,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:19,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319207280] [2024-10-24 11:52:19,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:19,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:52:19,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1925690843] [2024-10-24 11:52:19,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:19,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:52:19,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:52:19,579 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:52:19,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 11:52:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:52:19,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:52:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:52:20,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:52:20,247 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:52:20,248 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:52:20,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 11:52:20,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-24 11:52:20,454 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:20,532 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:52:20,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:52:20 BoogieIcfgContainer [2024-10-24 11:52:20,535 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:52:20,537 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:52:20,537 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:52:20,537 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:52:20,538 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:52:04" (3/4) ... [2024-10-24 11:52:20,540 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:52:20,541 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:52:20,542 INFO L158 Benchmark]: Toolchain (without parser) took 17602.12ms. Allocated memory was 163.6MB in the beginning and 474.0MB in the end (delta: 310.4MB). Free memory was 106.3MB in the beginning and 198.9MB in the end (delta: -92.6MB). Peak memory consumption was 220.9MB. Max. memory is 16.1GB. [2024-10-24 11:52:20,542 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 163.6MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:52:20,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.20ms. Allocated memory is still 163.6MB. Free memory was 106.3MB in the beginning and 88.3MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 11:52:20,542 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.61ms. Allocated memory is still 163.6MB. Free memory was 88.3MB in the beginning and 84.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:52:20,543 INFO L158 Benchmark]: Boogie Preprocessor took 85.89ms. Allocated memory is still 163.6MB. Free memory was 84.1MB in the beginning and 79.3MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:52:20,543 INFO L158 Benchmark]: RCFGBuilder took 760.95ms. Allocated memory is still 163.6MB. Free memory was 79.3MB in the beginning and 45.5MB in the end (delta: 33.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-24 11:52:20,544 INFO L158 Benchmark]: TraceAbstraction took 16241.37ms. Allocated memory was 163.6MB in the beginning and 474.0MB in the end (delta: 310.4MB). Free memory was 44.9MB in the beginning and 200.0MB in the end (delta: -155.1MB). Peak memory consumption was 155.9MB. Max. memory is 16.1GB. [2024-10-24 11:52:20,544 INFO L158 Benchmark]: Witness Printer took 3.97ms. Allocated memory is still 474.0MB. Free memory is still 198.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:52:20,547 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 163.6MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.20ms. Allocated memory is still 163.6MB. Free memory was 106.3MB in the beginning and 88.3MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.61ms. Allocated memory is still 163.6MB. Free memory was 88.3MB in the beginning and 84.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.89ms. Allocated memory is still 163.6MB. Free memory was 84.1MB in the beginning and 79.3MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 760.95ms. Allocated memory is still 163.6MB. Free memory was 79.3MB in the beginning and 45.5MB in the end (delta: 33.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 16241.37ms. Allocated memory was 163.6MB in the beginning and 474.0MB in the end (delta: 310.4MB). Free memory was 44.9MB in the beginning and 200.0MB in the end (delta: -155.1MB). Peak memory consumption was 155.9MB. Max. memory is 16.1GB. * Witness Printer took 3.97ms. Allocated memory is still 474.0MB. Free memory is still 198.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryFLOATComparisonOperation at line 107. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L55] signed long int last_1_WrapperStruct00_var_1_8 = -100; [L120] isInitial = 1 [L121] FCALL initially() [L122] COND TRUE 1 [L123] CALL updateLastVariables() [L113] EXPR WrapperStruct00.var_1_8 [L113] last_1_WrapperStruct00_var_1_8 = WrapperStruct00.var_1_8 [L123] RET updateLastVariables() [L124] CALL updateVariables() [L85] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L86] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L87] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L88] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L89] EXPR WrapperStruct00.var_1_10 [L89] EXPR WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L89] EXPR WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L89] EXPR WrapperStruct00.var_1_10 [L89] EXPR WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L89] EXPR (WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L89] EXPR (WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L89] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L89] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L90] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_10 != 0.0F) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_10 != 0.0F) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L91] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L93] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L94] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L96] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L97] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L98] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L99] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L100] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L101] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L102] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L103] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L105] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L106] WrapperStruct00.var_1_19 = __VERIFIER_nondet_float() [L107] EXPR WrapperStruct00.var_1_19 [L107] EXPR WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L107] EXPR WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_19 [L107] EXPR WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L107] EXPR (WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L107] EXPR (WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L108] WrapperStruct00.var_1_21 = __VERIFIER_nondet_char() [L109] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_21 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_21 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L110] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_21 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_21 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L124] RET updateVariables() [L125] CALL step() [L59] EXPR WrapperStruct00.var_1_19 [L59] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_19 [L60] EXPR WrapperStruct00.var_1_21 [L60] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_21 [L61] EXPR WrapperStruct00.var_1_18 [L61] EXPR WrapperStruct00.var_1_10 [L61] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L61] COND FALSE !((WrapperStruct00.var_1_18 / WrapperStruct00.var_1_10) >= (WrapperStruct00.var_1_18 / 128.6)) [L64] EXPR WrapperStruct00.var_1_18 [L64] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L64] COND TRUE WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_10 [L65] WrapperStruct00.var_1_8 = 256 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L70] EXPR WrapperStruct00.var_1_8 [L70] EXPR WrapperStruct00.var_1_20 [L70] EXPR WrapperStruct00.var_1_8 [L70] signed long int stepLocal_0 = (WrapperStruct00.var_1_8 * WrapperStruct00.var_1_20) * WrapperStruct00.var_1_8; [L71] EXPR WrapperStruct00.var_1_20 [L71] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L71] EXPR ((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8) [L71] EXPR WrapperStruct00.var_1_8 [L71] EXPR ((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100, stepLocal_0=-65536] [L71] COND TRUE stepLocal_0 < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8))) [L72] EXPR WrapperStruct00.var_1_7 [L72] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_7 [L76] EXPR WrapperStruct00.var_1_1 [L76] EXPR WrapperStruct00.var_1_13 [L76] EXPR WrapperStruct00.var_1_14 [L76] (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) && WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L76] (WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) && WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L76] COND FALSE !((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) && WrapperStruct00.var_1_15) [L81] EXPR WrapperStruct00.var_1_17 [L81] WrapperStruct00.var_1_12 = WrapperStruct00.var_1_17 [L125] RET step() [L126] CALL, EXPR property() [L116] EXPR WrapperStruct00.var_1_8 [L116] EXPR WrapperStruct00.var_1_20 [L116] EXPR WrapperStruct00.var_1_8 [L116] EXPR WrapperStruct00.var_1_20 [L116] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] EXPR ((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8) [L116] EXPR WrapperStruct00.var_1_8 [L116] EXPR ((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] EXPR (((WrapperStruct00.var_1_8 * WrapperStruct00.var_1_20) * WrapperStruct00.var_1_8) < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) [L116] EXPR WrapperStruct00.var_1_1 [L116] EXPR WrapperStruct00.var_1_7 [L116] EXPR (((WrapperStruct00.var_1_8 * WrapperStruct00.var_1_20) * WrapperStruct00.var_1_8) < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] EXPR ((((WrapperStruct00.var_1_8 * WrapperStruct00.var_1_20) * WrapperStruct00.var_1_8) < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && (((WrapperStruct00.var_1_18 / WrapperStruct00.var_1_10) >= (WrapperStruct00.var_1_18 / 128.6)) ? (WrapperStruct00.var_1_8 == ((signed long int) ((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_7 + last_1_WrapperStruct00_var_1_8)) - WrapperStruct00.var_1_20))) : ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_8 == ((signed long int) 256)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_20)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] EXPR ((((WrapperStruct00.var_1_8 * WrapperStruct00.var_1_20) * WrapperStruct00.var_1_8) < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && (((WrapperStruct00.var_1_18 / WrapperStruct00.var_1_10) >= (WrapperStruct00.var_1_18 / 128.6)) ? (WrapperStruct00.var_1_8 == ((signed long int) ((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_7 + last_1_WrapperStruct00_var_1_8)) - WrapperStruct00.var_1_20))) : ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_8 == ((signed long int) 256)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_20)))) [L116] EXPR WrapperStruct00.var_1_18 [L116] EXPR WrapperStruct00.var_1_10 [L116] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] EXPR ((WrapperStruct00.var_1_18 / WrapperStruct00.var_1_10) >= (WrapperStruct00.var_1_18 / 128.6)) ? (WrapperStruct00.var_1_8 == ((signed long int) ((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_7 + last_1_WrapperStruct00_var_1_8)) - WrapperStruct00.var_1_20))) : ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_8 == ((signed long int) 256)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_20))) [L116] EXPR WrapperStruct00.var_1_8 [L116] EXPR WrapperStruct00.var_1_20 [L116] EXPR WrapperStruct00.var_1_7 [L116] EXPR WrapperStruct00.var_1_20 [L116] EXPR ((WrapperStruct00.var_1_18 / WrapperStruct00.var_1_10) >= (WrapperStruct00.var_1_18 / 128.6)) ? (WrapperStruct00.var_1_8 == ((signed long int) ((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_7 + last_1_WrapperStruct00_var_1_8)) - WrapperStruct00.var_1_20))) : ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_8 == ((signed long int) 256)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_20))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] EXPR ((((WrapperStruct00.var_1_8 * WrapperStruct00.var_1_20) * WrapperStruct00.var_1_8) < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && (((WrapperStruct00.var_1_18 / WrapperStruct00.var_1_10) >= (WrapperStruct00.var_1_18 / 128.6)) ? (WrapperStruct00.var_1_8 == ((signed long int) ((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_7 + last_1_WrapperStruct00_var_1_8)) - WrapperStruct00.var_1_20))) : ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_8 == ((signed long int) 256)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_20)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] EXPR (((((WrapperStruct00.var_1_8 * WrapperStruct00.var_1_20) * WrapperStruct00.var_1_8) < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && (((WrapperStruct00.var_1_18 / WrapperStruct00.var_1_10) >= (WrapperStruct00.var_1_18 / 128.6)) ? (WrapperStruct00.var_1_8 == ((signed long int) ((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_7 + last_1_WrapperStruct00_var_1_8)) - WrapperStruct00.var_1_20))) : ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_8 == ((signed long int) 256)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_20))))) && (((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_15 ? (WrapperStruct00.var_1_12 == ((unsigned char) (((((WrapperStruct00.var_1_16 - WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_16 - WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_7))))) : 1) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_17))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] EXPR (((((WrapperStruct00.var_1_8 * WrapperStruct00.var_1_20) * WrapperStruct00.var_1_8) < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && (((WrapperStruct00.var_1_18 / WrapperStruct00.var_1_10) >= (WrapperStruct00.var_1_18 / 128.6)) ? (WrapperStruct00.var_1_8 == ((signed long int) ((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_7 + last_1_WrapperStruct00_var_1_8)) - WrapperStruct00.var_1_20))) : ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_8 == ((signed long int) 256)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_20))))) && (((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_15 ? (WrapperStruct00.var_1_12 == ((unsigned char) (((((WrapperStruct00.var_1_16 - WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_16 - WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_7))))) : 1) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_17))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] EXPR ((((((WrapperStruct00.var_1_8 * WrapperStruct00.var_1_20) * WrapperStruct00.var_1_8) < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && (((WrapperStruct00.var_1_18 / WrapperStruct00.var_1_10) >= (WrapperStruct00.var_1_18 / 128.6)) ? (WrapperStruct00.var_1_8 == ((signed long int) ((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_7 + last_1_WrapperStruct00_var_1_8)) - WrapperStruct00.var_1_20))) : ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_8 == ((signed long int) 256)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_20))))) && (((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_15 ? (WrapperStruct00.var_1_12 == ((unsigned char) (((((WrapperStruct00.var_1_16 - WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_16 - WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_7))))) : 1) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_17)))) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] EXPR ((((((WrapperStruct00.var_1_8 * WrapperStruct00.var_1_20) * WrapperStruct00.var_1_8) < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && (((WrapperStruct00.var_1_18 / WrapperStruct00.var_1_10) >= (WrapperStruct00.var_1_18 / 128.6)) ? (WrapperStruct00.var_1_8 == ((signed long int) ((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_7 + last_1_WrapperStruct00_var_1_8)) - WrapperStruct00.var_1_20))) : ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_8 == ((signed long int) 256)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_20))))) && (((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_15 ? (WrapperStruct00.var_1_12 == ((unsigned char) (((((WrapperStruct00.var_1_16 - WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_16 - WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_7))))) : 1) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_17)))) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] EXPR (((((((WrapperStruct00.var_1_8 * WrapperStruct00.var_1_20) * WrapperStruct00.var_1_8) < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && (((WrapperStruct00.var_1_18 / WrapperStruct00.var_1_10) >= (WrapperStruct00.var_1_18 / 128.6)) ? (WrapperStruct00.var_1_8 == ((signed long int) ((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_7 + last_1_WrapperStruct00_var_1_8)) - WrapperStruct00.var_1_20))) : ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_8 == ((signed long int) 256)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_20))))) && (((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_15 ? (WrapperStruct00.var_1_12 == ((unsigned char) (((((WrapperStruct00.var_1_16 - WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_16 - WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_7))))) : 1) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_17)))) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((signed char) WrapperStruct00.var_1_21)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] EXPR (((((((WrapperStruct00.var_1_8 * WrapperStruct00.var_1_20) * WrapperStruct00.var_1_8) < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && (((WrapperStruct00.var_1_18 / WrapperStruct00.var_1_10) >= (WrapperStruct00.var_1_18 / 128.6)) ? (WrapperStruct00.var_1_8 == ((signed long int) ((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_7 + last_1_WrapperStruct00_var_1_8)) - WrapperStruct00.var_1_20))) : ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_8 == ((signed long int) 256)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_20))))) && (((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_15 ? (WrapperStruct00.var_1_12 == ((unsigned char) (((((WrapperStruct00.var_1_16 - WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_16 - WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_7))))) : 1) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_17)))) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((signed char) WrapperStruct00.var_1_21)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116-L117] return (((((((WrapperStruct00.var_1_8 * WrapperStruct00.var_1_20) * WrapperStruct00.var_1_8) < ((((WrapperStruct00.var_1_20) > (WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_20) : (WrapperStruct00.var_1_8)))) ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7))) && (((WrapperStruct00.var_1_18 / WrapperStruct00.var_1_10) >= (WrapperStruct00.var_1_18 / 128.6)) ? (WrapperStruct00.var_1_8 == ((signed long int) ((WrapperStruct00.var_1_20 + (WrapperStruct00.var_1_7 + last_1_WrapperStruct00_var_1_8)) - WrapperStruct00.var_1_20))) : ((WrapperStruct00.var_1_18 <= WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_8 == ((signed long int) 256)) : (WrapperStruct00.var_1_8 == ((signed long int) WrapperStruct00.var_1_20))))) && (((WrapperStruct00.var_1_1 == (WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14)) && WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_15 ? (WrapperStruct00.var_1_12 == ((unsigned char) (((((WrapperStruct00.var_1_16 - WrapperStruct00.var_1_14)) > (WrapperStruct00.var_1_7)) ? ((WrapperStruct00.var_1_16 - WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_7))))) : 1) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_17)))) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((signed char) WrapperStruct00.var_1_21)) ; [L126] RET, EXPR property() [L126] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.1s, OverallIterations: 11, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2004 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2002 mSDsluCounter, 4658 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3397 mSDsCounter, 537 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3693 IncrementalHoareTripleChecker+Invalid, 4230 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 537 mSolverCounterUnsat, 1261 mSDtfsCounter, 3693 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 588 GetRequests, 514 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=312occurred in iteration=7, InterpolantAutomatonStates: 70, 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, 10 MinimizatonAttempts, 767 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 1724 NumberOfCodeBlocks, 1724 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1312 ConstructedInterpolants, 0 QuantifiedInterpolants, 3479 SizeOfPredicates, 3 NumberOfNonLiveVariables, 454 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 5440/5440 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 could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:52:20,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-75.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aae2fa1a6f385f97337cc2b739ec0b65ccf727ece5077a08bd3db09419c3a3cc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:52:22,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:52:22,975 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:52:22,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:52:22,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:52:23,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:52:23,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:52:23,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:52:23,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:52:23,017 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:52:23,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:52:23,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:52:23,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:52:23,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:52:23,020 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:52:23,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:52:23,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:52:23,021 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:52:23,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:52:23,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:52:23,022 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:52:23,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:52:23,025 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:52:23,025 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:52:23,025 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:52:23,025 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:52:23,025 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:52:23,026 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:52:23,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:52:23,026 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:52:23,026 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:52:23,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:52:23,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:52:23,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:52:23,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:52:23,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:52:23,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:52:23,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:52:23,028 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:52:23,028 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:52:23,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:52:23,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:52:23,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:52:23,031 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:52:23,031 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:52:23,031 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aae2fa1a6f385f97337cc2b739ec0b65ccf727ece5077a08bd3db09419c3a3cc [2024-10-24 11:52:23,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:52:23,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:52:23,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:52:23,360 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:52:23,361 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:52:23,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-75.i [2024-10-24 11:52:24,870 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:52:25,072 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:52:25,072 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-75.i [2024-10-24 11:52:25,081 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f727990dc/5064af9a217e4c50bae1345394c5b87e/FLAG4fea0b2bc [2024-10-24 11:52:25,093 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f727990dc/5064af9a217e4c50bae1345394c5b87e [2024-10-24 11:52:25,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:52:25,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:52:25,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:52:25,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:52:25,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:52:25,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:52:25" (1/1) ... [2024-10-24 11:52:25,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e99bed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:25, skipping insertion in model container [2024-10-24 11:52:25,105 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:52:25" (1/1) ... [2024-10-24 11:52:25,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:52:25,324 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-75.i[916,929] [2024-10-24 11:52:25,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:52:25,417 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:52:25,430 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-75.i[916,929] [2024-10-24 11:52:25,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:52:25,533 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:52:25,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:25 WrapperNode [2024-10-24 11:52:25,533 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:52:25,534 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:52:25,534 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:52:25,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:52:25,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:25" (1/1) ... [2024-10-24 11:52:25,566 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:25" (1/1) ... [2024-10-24 11:52:25,616 INFO L138 Inliner]: procedures = 36, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 458 [2024-10-24 11:52:25,620 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:52:25,621 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:52:25,621 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:52:25,621 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:52:25,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:25" (1/1) ... [2024-10-24 11:52:25,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:25" (1/1) ... [2024-10-24 11:52:25,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:25" (1/1) ... [2024-10-24 11:52:25,679 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 18 writes are split as follows [0, 18]. [2024-10-24 11:52:25,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:25" (1/1) ... [2024-10-24 11:52:25,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:25" (1/1) ... [2024-10-24 11:52:25,709 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:25" (1/1) ... [2024-10-24 11:52:25,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:25" (1/1) ... [2024-10-24 11:52:25,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:25" (1/1) ... [2024-10-24 11:52:25,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:25" (1/1) ... [2024-10-24 11:52:25,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:52:25,741 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:52:25,741 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:52:25,741 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:52:25,742 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:25" (1/1) ... [2024-10-24 11:52:25,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:52:25,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:52:25,782 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 11:52:25,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 11:52:25,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:52:25,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-24 11:52:25,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-24 11:52:25,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-24 11:52:25,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-24 11:52:25,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:52:25,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:52:25,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:52:25,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:52:25,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:52:25,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:52:25,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:52:25,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:52:25,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-24 11:52:25,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-24 11:52:25,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:52:25,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:52:25,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:52:25,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:52:25,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:52:25,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:52:25,840 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:52:25,841 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:52:25,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:52:25,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:52:25,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:52:25,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:52:25,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:52:25,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:52:25,993 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:52:25,996 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:52:45,508 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-10-24 11:52:45,508 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:52:45,549 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:52:45,549 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:52:45,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:52:45 BoogieIcfgContainer [2024-10-24 11:52:45,550 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:52:45,552 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:52:45,553 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:52:45,556 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:52:45,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:52:25" (1/3) ... [2024-10-24 11:52:45,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b3f71e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:52:45, skipping insertion in model container [2024-10-24 11:52:45,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:25" (2/3) ... [2024-10-24 11:52:45,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b3f71e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:52:45, skipping insertion in model container [2024-10-24 11:52:45,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:52:45" (3/3) ... [2024-10-24 11:52:45,559 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-75.i [2024-10-24 11:52:45,577 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:52:45,577 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:52:45,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:52:45,645 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4cf83794, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:52:45,645 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:52:45,650 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 71 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:52:45,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:52:45,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:45,662 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:45,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:45,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:45,668 INFO L85 PathProgramCache]: Analyzing trace with hash -950670421, now seen corresponding path program 1 times [2024-10-24 11:52:45,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:52:45,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791157679] [2024-10-24 11:52:45,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:45,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:52:45,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:52:45,696 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:52:45,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 11:52:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:47,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:52:47,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:52:47,235 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-10-24 11:52:47,235 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:52:47,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:52:47,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791157679] [2024-10-24 11:52:47,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791157679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:47,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:47,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:52:47,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366173777] [2024-10-24 11:52:47,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:47,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:52:47,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:52:47,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:52:47,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:52:47,268 INFO L87 Difference]: Start difference. First operand has 90 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 71 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:52:47,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:47,434 INFO L93 Difference]: Finished difference Result 177 states and 285 transitions. [2024-10-24 11:52:47,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:52:47,437 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2024-10-24 11:52:47,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:47,446 INFO L225 Difference]: With dead ends: 177 [2024-10-24 11:52:47,447 INFO L226 Difference]: Without dead ends: 88 [2024-10-24 11:52:47,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:52:47,457 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:47,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:52:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-24 11:52:47,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-24 11:52:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.391304347826087) internal successors, (96), 69 states have internal predecessors, (96), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:52:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2024-10-24 11:52:47,515 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 131 [2024-10-24 11:52:47,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:47,517 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 130 transitions. [2024-10-24 11:52:47,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:52:47,517 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 130 transitions. [2024-10-24 11:52:47,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:52:47,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:47,522 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:47,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 11:52:47,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:52:47,723 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:47,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:47,724 INFO L85 PathProgramCache]: Analyzing trace with hash 685314461, now seen corresponding path program 1 times [2024-10-24 11:52:47,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:52:47,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372551857] [2024-10-24 11:52:47,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:47,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:52:47,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:52:47,729 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:52:47,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 11:52:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:49,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:52:49,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:52:49,630 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-10-24 11:52:49,630 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:52:49,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:52:49,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372551857] [2024-10-24 11:52:49,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372551857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:49,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:49,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:52:49,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826305398] [2024-10-24 11:52:49,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:49,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:52:49,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:52:49,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:52:49,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:52:49,638 INFO L87 Difference]: Start difference. First operand 88 states and 130 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:52:50,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:50,363 INFO L93 Difference]: Finished difference Result 177 states and 262 transitions. [2024-10-24 11:52:50,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:52:50,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2024-10-24 11:52:50,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:50,369 INFO L225 Difference]: With dead ends: 177 [2024-10-24 11:52:50,369 INFO L226 Difference]: Without dead ends: 90 [2024-10-24 11:52:50,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:52:50,372 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:50,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 365 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 11:52:50,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-24 11:52:50,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-24 11:52:50,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.380281690140845) internal successors, (98), 71 states have internal predecessors, (98), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:52:50,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2024-10-24 11:52:50,385 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 131 [2024-10-24 11:52:50,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:50,386 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2024-10-24 11:52:50,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 11:52:50,387 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2024-10-24 11:52:50,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:52:50,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:50,389 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:50,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 11:52:50,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:52:50,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:50,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:50,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1887650149, now seen corresponding path program 1 times [2024-10-24 11:52:50,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:52:50,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926752798] [2024-10-24 11:52:50,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:50,592 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:52:50,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:52:50,593 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:52:50,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 11:52:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:52,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:52:52,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:52:52,679 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:52:52,680 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:52:52,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:52:52,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926752798] [2024-10-24 11:52:52,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926752798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:52,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:52,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:52:52,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658138637] [2024-10-24 11:52:52,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:52,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:52:52,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:52:52,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:52:52,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:52:52,683 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:52:53,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:53,869 INFO L93 Difference]: Finished difference Result 184 states and 270 transitions. [2024-10-24 11:52:53,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:52:53,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-24 11:52:53,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:53,871 INFO L225 Difference]: With dead ends: 184 [2024-10-24 11:52:53,871 INFO L226 Difference]: Without dead ends: 95 [2024-10-24 11:52:53,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:52:53,873 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:53,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 474 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 11:52:53,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-24 11:52:53,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-10-24 11:52:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:52:53,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-10-24 11:52:53,887 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 131 [2024-10-24 11:52:53,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:53,888 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-10-24 11:52:53,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:52:53,889 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-10-24 11:52:53,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:52:53,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:53,892 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:53,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 11:52:54,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:52:54,093 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:54,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:54,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1830391847, now seen corresponding path program 1 times [2024-10-24 11:52:54,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:52:54,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907401592] [2024-10-24 11:52:54,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:54,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:52:54,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:52:54,098 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:52:54,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 11:52:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:55,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:52:55,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:52:56,558 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:52:56,559 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:52:56,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:52:56,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907401592] [2024-10-24 11:52:56,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1907401592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:56,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:56,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:52:56,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128910766] [2024-10-24 11:52:56,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:56,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:52:56,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:52:56,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:52:56,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:52:56,562 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:52:58,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:58,036 INFO L93 Difference]: Finished difference Result 190 states and 275 transitions. [2024-10-24 11:52:58,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:52:58,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2024-10-24 11:52:58,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:58,038 INFO L225 Difference]: With dead ends: 190 [2024-10-24 11:52:58,038 INFO L226 Difference]: Without dead ends: 97 [2024-10-24 11:52:58,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:52:58,044 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 1 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:58,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 588 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 11:52:58,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-24 11:52:58,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2024-10-24 11:52:58,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-24 11:52:58,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2024-10-24 11:52:58,062 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 131 [2024-10-24 11:52:58,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:58,063 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2024-10-24 11:52:58,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:52:58,063 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2024-10-24 11:52:58,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 11:52:58,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:58,065 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:52:58,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 11:52:58,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:52:58,266 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:58,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:58,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1830332265, now seen corresponding path program 1 times [2024-10-24 11:52:58,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:52:58,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429125559] [2024-10-24 11:52:58,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:58,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:52:58,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:52:58,269 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:52:58,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 11:53:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:00,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 11:53:00,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:53:00,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 11:53:00,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2024-10-24 11:53:01,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:01,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 42 [2024-10-24 11:53:01,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:01,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 35 [2024-10-24 11:53:02,575 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-24 11:53:02,576 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:53:02,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:53:02,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429125559] [2024-10-24 11:53:02,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429125559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:02,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:02,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:53:02,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579838620] [2024-10-24 11:53:02,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:02,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:53:02,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:53:02,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:53:02,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:53:02,578 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-24 11:53:08,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:53:12,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:53:17,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:53:21,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []